Routing open shop and flow shop scheduling problems

Yu, Wei; Liu, Zhaohui; Wang, Leiyang; Fan, Tijun

doi:10.1016/j.ejor.2011.02.028

Cited by 26 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A practical challenge is that at each stage, alternative machines may perform the operations. This creates flexibility in the process plan and requires both a machine assignment and sequencing the tasks (Yu et al 2011). The optimiszation objectives in practice are multiple ones and may be related to the maximisation of the processed jobs, completing the jobs on time (e.g.…”

Section: Literature Reviewmentioning

confidence: 99%

A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0

Ivanov

Dolgui

Sokolov

et al. 2015

International Journal of Production Research

469

194

View full text Add to dashboard Cite

International audienceSmart factories Industry 4.0 on the basis of collaborative cyber-physical systems represents a future form of industrial networks. Supply chains in such networks have dynamic structures which evolve over time. In these settings, short-term supply chain scheduling in smart factories Industry 4.0 is challenged by temporal machine structures, different processing speed at parallel machines and dynamic job arrivals. In this study, for the first time, a dynamic model and algorithm for short-term supply chain scheduling in smart factories Industry 4.0 is presented. The peculiarity of the considered problem is the simultaneous consideration of both machine structure selection and job assignments. The scheduling approach is based on a dynamic non-stationary interpretation of the execution of the jobs and a temporal decomposition of the scheduling problem. The algorithmic realisation is based on a modified form of the continuous maximum principle blended with mathematical optimisation. A detailed theoretical analysis of the temporal decomposition and computational complexity is performed. The optimality conditions as well as the structural properties of the model and the algorithm are investigated. Advantages and limitations of the proposed approach are discussed

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0

Ivanov

Dolgui

Sokolov

et al. 2015

International Journal of Production Research

469

194

View full text Add to dashboard Cite

show abstract

“…This problem is related to the well-known multiple traveling salesman problem (mTSP) (see, e.g., Bektas 2006;Kara and Bektas 2006) and the open-shop scheduling problem (OSP) (see, e.g., Graves 1981;Yu et al 2011). The major difference to the mTSP is that in the problem at hand, each site is to be visited by each bus, whereas in the mTSP, each site is to be visited by exactly one salesperson.…”

Section: Introductionmentioning

confidence: 99%

A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

Brandinu

Trautmann

2014

J Sched

View full text Add to dashboard Cite

This paper deals with "The Enchanted Journey," which is a daily event tour booked by Bollywood-film fans. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour. For operational reasons, however, two or more buses cannot stay at the same location simultaneously. Further operative constraints include time windows for all activities and precedence constraints between some activities. The planning problem is how to compute a feasible schedule for each bus. We implement a two-step hierarchical approach. In the first step, we minimize the total waiting time; in the second step, we minimize the total travel time of all buses. We present a basic formulation of this problem as a mixed-integer linear program. We enhance this basic formulation by symmetry-breaking constraints, which reduces the search space without loss of generality. We report on computational results obtained with the Gurobi Solver. Our numerical results show that all relevant problem instances can be solved using the basic formulation within reasonable CPU time, and that the symmetry-breaking constraints reduce that CPU time considerably.

show abstract

“…Both algorithms deal with the flow-shop better than those presented in [10,22]. In [21] the NPhardness of two-machine routing flow-shop is proved via the reduction from the partitioning problem.…”

Section: Introductionmentioning

confidence: 99%

“…A 10/7-approximation algorithm for two-machine routing flow-shop is given in [21]. The same work contains also another approximation algorithm for mmachine routing open-shop as well as for the routing flow-shop with unlimited buffers and without ready times.…”

Section: Introductionmentioning

confidence: 99%

Routing Flow-Shop with Buffers and Ready Times – Comparison of Selected Solution Algorithms

Józefczyk¹,

Markowski²,

Balgabaeva³

2014

Management and Production Engineering Review

View full text Add to dashboard Cite

Accepted: 12 October 2014 This article extends the former results concerning the routing flow-shop problem to minimize the makespan on the case with buffers, non-zero ready times and different speeds of machines. The corresponding combinatorial optimization problem is formulated. The exact as well as four heuristic solution algorithms are presented. The branch and bound approach is applied for the former one. The heuristic algorithms employ known constructive idea proposed for the former version of the problem as well as the Tabu Search metaheuristics. Moreover, the improvement procedure is proposed to enhance the quality of both heuristic algorithms. The conducted simulation experiments allow evaluating all algorithms. Firstly, the heuristic algorithms are compared with the exact one for small instances of the problem in terms of the criterion and execution times. Then, for larger instances, the heuristic algorithms are mutually compared. The case study regarding the maintenance of software products, given in the final part of the paper, illustrates the possibility to apply the results for real-world manufacturing systems.

show abstract

Routing open shop and flow shop scheduling problems

Cited by 26 publications

References 18 publications

A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0

A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0

A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

Routing Flow-Shop with Buffers and Ready Times – Comparison of Selected Solution Algorithms

Contact Info

Product

Resources

About