Flowshop scheduling problems with transportation or deterioration between the batching and single machines

Authors:
Lixin Tang;Peng Liu
Affiliations:
The Logistics Institute, Northeastern University, No. 11, Lane 3, WenHua Road, Shenyang 110004, China;The Logistics Institute, Northeastern University, No. 11, Lane 3, WenHua Road, Shenyang 110004, China
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 8
Cited 3

Batching and scheduling jobs on batch and discrete processors

Operations Research
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Makespan minimization for flow-shop problems with transportation times and a single robot

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

Computers and Operations Research
A hybrid two-stage flowshop with limited waiting time constraints

Computers and Industrial Engineering
Scheduling jobs under decreasing linear deterioration

Information Processing Letters

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

Computers and Operations Research
Two-stage hybrid flow shop scheduling with dynamic job arrivals

Computers and Operations Research
Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider two new types of the two-machine flowshop scheduling problems where a batching machine is followed by a single machine. The first type is that normal jobs with transportation between machines are scheduled on the batching and single machines. The second type is that normal jobs are processed on the batching machine while deteriorating jobs are scheduled on the single machine. For the first type, we formulate the problem to minimize the makespan as a mixed integer programming model and prove that it is strongly NP-hard. Furthermore, a heuristic algorithm along with a worst case error bound is derived and the computational experiments are also carried out to verify the effectiveness of the proposed heuristic algorithm. For the second type, the two objectives are considered. For the problem with minimizing the makespan, we find an optimal polynomial algorithm. For the problem with minimizing the sum of completion time, we show that it is strongly NP-hard and propose an optimal polynomial algorithm for its special case.