The flexible blocking job shop with transfer and set-up times

Gröflin, Heinz; Pham, Dinh Nguyen; Bürgy, Reinhard

doi:10.1007/s10878-009-9278-x

Cited by 29 publications

(14 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The neighborhood in a sense extends the idea of swapping a critical arc and is based on a neighbor generation scheme that extracts a job from a given solution and reinserts it into a feasible neighbor position. The neighbor generation scheme relies on the job insertion theory developed by Gröflin and Klinkert (2007), and has already been successfully applied in various job shop scheduling problems with the makespan objective, namely, in the (flexible) blocking job shop (Gröflin and Klinkert, 2009;Gröflin et al, 2011), in the blocking job shop with rail-bound transportation (Bürgy and Gröflin, 2016), and in a more general job shop model (Bürgy, 2014). This article casts the neighbor generation scheme in a unifying framework and extends its use to any regular objective.…”

Section: Introductionmentioning

confidence: 99%

A neighborhood for complex job shop scheduling problems with regular objectives

Bürgy

2017

J Sched

Self Cite

View full text Add to dashboard Cite

Due to the limited applicability in practice of the classical job shop scheduling problem, many researchers have addressed more complex versions of this problem by including additional process features, such as time lags, setup times, and buffer limitations, and have pursued objectives that are more practically relevant than the makespan, such as total flow time and total weighted tardiness. However, most proposed solution approaches are tailored to the specific scheduling problem studied and are not applicable to more general settings.This article proposes a neighborhood that can be applied for a large class of job shop scheduling problems with regular objectives. Feasible neighbor solutions are generated by extracting a job from a given solution and reinserting it into a neighbor position. This neighbor generation in a sense extends the simple swapping of critical arcs, a mechanism that is widely used in the classical job shop but that is not applicable in more complex job shop problems.The neighborhood is embedded in a tabu search, and its performance is evaluated with an extensive experimental study using three standard job shop scheduling problems: the (classical) job shop, the job shop with sequence-dependent setup times, and the blocking job shop, combined with the following five regular objectives: makespan, total flow time, total squared flow time, total tardiness, and total weighted tardiness. The obtained results support the validity of the approach.Keywords job shop scheduling • general regular objective • sequence-dependent setup times • blocking job shop • job insertion • neighborhood • tabu search

show abstract

Section: Introductionmentioning

confidence: 99%

A neighborhood for complex job shop scheduling problems with regular objectives

Bürgy

2017

J Sched

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, swapping individual critical arcs only may lead to infeasible neighbors. Job-insertion-based neighborhoods, which were already applied successfully in various complex job shop scheduling problems (Gröflin et al, 2011;Bürgy andGröflin, 2016, 2017) could be employed to preserve feasibility of the neighborhood.…”

Section: Resultsmentioning

confidence: 99%

The job shop scheduling problem with convex costs

Bürgy

Bülbül

2018

European Journal of Operational Research

Self Cite

View full text Add to dashboard Cite

The job shop scheduling literature has been dominated by a focus on regular objective functionsin particular the makespan -in its half a century long history. The last twenty years have encountered a spike of interest in other objectives, such as the total weighted tardiness, but research on non-regular objective functions has always been isolated and scattered. Motivated by this observation, we present a tabu search heuristic for a large class of job shop scheduling problems, where the objective is non-regular in general and minimizes a sum of separable convex cost functions attached to the operation start times and the differences between the start times of arbitrary pairs of operations. This problem definition generalizes a number of problems considered earlier in the literature. A particular notion of "critical paths" derived from the so-called timing problem is at the core of the proposed neighborhood definition exploited successfully in a tabu search algorithm. The computational results attest to the promise of our work.

show abstract

“…Dwell and idle points are not considered in this study. Enhancing the notation of Gröflin [15] with the ideas of Poppenborg [23], leads to a model with reentrant processes, blocking and transfer times as well as the possibility to consider set-up times for each order. The model divides every operation into multiple steps and synchronizes the start of a step with its predecessor's steps.…”

Section: Scenariomentioning

confidence: 99%

Optimal Scheduling for Automated Guided Vehicles (AGV) in Blocking Job-Shops

Heger

Voß

2017

Advances in Production Management Systems. The Path to Intelligent, Collaborative and Sustainable Manufacturing

View full text Add to dashboard Cite

Promising developments and further improvements of cyber physical logistics systems (CPLS) and automated guided vehicles (AGV) lead to broader application of such systems in production environments and smart factories. In this study a new mixed integer linear program (MILP) is presented for the scheduling of AGVs in a flexible reentrant job shop with blocking. Optimal solutions to small instances of the complex scheduling problem in a make-to-order production, minimizing the make span, are calculated. Different numbers of jobs are considered. Feasible schedules for the machines and the AGVs are generated from different sized instances to evaluate the limits of the mathematical model.

show abstract

The flexible blocking job shop with transfer and set-up times

Cited by 29 publications

References 10 publications

A neighborhood for complex job shop scheduling problems with regular objectives

A neighborhood for complex job shop scheduling problems with regular objectives

The job shop scheduling problem with convex costs

Optimal Scheduling for Automated Guided Vehicles (AGV) in Blocking Job-Shops

Contact Info

Product

Resources

About