Two-machine flowshop scheduling with intermediate transportation under job physical space consideration

Authors:
Hua Gong;Lixin Tang
Affiliations:
Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang 110004, China and College of Science, Shenyang Ligong University, Shenyang ...;Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang 110004, China
Venue:
Computers and Operations Research
Year:
2011

Citing 4
Cited 1

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved algorithms for two single machine scheduling problems

Theoretical Computer Science - Algorithmic applications in management
Flowshop scheduling problems with transportation or deterioration between the batching and single machines

Computers and Industrial Engineering
Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration

Computers and Industrial Engineering

A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we study a coordinated production-transportation scheduling problem in a two-machine flowshop environment where a single transporter may carry several jobs simultaneously as a batch between the machines. Each job has its own physical-space requirement while being loaded into the transporter. The goal is to minimize the makespan. For the jobs with the same size of physical space during transportation, we present a heuristic algorithm with an absolute worst-case ratio of 2 and a polynomial-time optimal algorithm for a special case with given job sequence. For the jobs having different size of physical storage space, a heuristic algorithm is constructed with an absolute worst-case ratio of 7/3 and asymptotic worst-case ratio of 20/9. Computational experiments demonstrate that the two heuristic algorithms developed are capable of generating near-optimal solutions quickly.