The blocking job shop with rail-bound transportation

Bürgy, Reinhard; Gröflin, Heinz

doi:10.1007/s10878-014-9723-3

Cited by 13 publications

(9 citation statements)

References 24 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

“…He provided tests on [19] and a large-scale JSP benchmark instances and proved that the proposed exact model converges to optimal values in record time (less than one second in most of the cases). References [22] and [23] treated a JSP with blocking constraints in a multiple AGV based MHS. Both contributions considered a job shop cell with an additional loading/unloading station, and provided a local search based approach to optimize the final schedule solution.…”

Section: Literature and Related Workmentioning

confidence: 99%

Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

et al. 2020

View full text Add to dashboard Cite

In job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.

show abstract

“…Further algorithms for general railway scheduling problems have been given for instance in [17][18][19] and for job-shop scheduling problems with blocking in [20,21]. The blocking job-shop with rail-bound transportation has also been discussed in [22]. Please note that for a small railway network with only a few stations and enough parallel tracks at each station, the blocking constraint can be skipped as in our three-station case.…”

Section: Literature Overviewmentioning

confidence: 99%

Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine

Gafarov

Werner

2019

Mathematics

View full text Add to dashboard Cite

In this paper, we consider a two-machine job-shop scheduling problem of minimizing total completion time subject to n jobs with two operations and equal processing times on each machine. This problem occurs e.g., as a single-track railway scheduling problem with three stations and constant travel times between any two adjacent stations. We present a polynomial dynamic programming algorithm of the complexity O ( n 5 ) and a heuristic procedure of the complexity O ( n 3 ) . This settles the complexity status of the problem under consideration which was open before and extends earlier work for the two-station single-track railway scheduling problem. We also present computational results of the comparison of both algorithms. For the 30,000 instances with up to 30 jobs considered, the average relative error of the heuristic is less than 1 % . In our tests, the practical running time of the dynamic programming algorithm was even bounded by O ( n 4 ) .

show abstract

The blocking job shop with rail-bound transportation

Cited by 13 publications

References 24 publications

A neighborhood for complex job shop scheduling problems with regular objectives

A neighborhood for complex job shop scheduling problems with regular objectives

Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine

Contact Info

Product

Resources

About