A Two-Stage Flexible Flowshop Problem with Deterioration

Authors:
Hua Gong;Lixin Tang
Affiliations:
The Logistics Institute, Northeastern University, Shenyang, China;The Logistics Institute, Northeastern University, Shenyang, China
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 3
Cited 0

Batching and scheduling jobs on batch and discrete processors

Operations Research
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a scheduling problem under considering deterioration on a two-stage flexible flowshop of particular structure (parallel machines in the first stage and a single batching machine in the second stage). The deterioration of a job means that its processing time on the batching machine is dependent on its waiting time, i.e., the time between the completion of the job in the first stage and the start of the job in the second stage. The objective is to minimize the makespan plus the total penalty cost of batching-machine utilization ratio. First, we prove the problem is strongly NP-hard. An efficient heuristic algorithm for the general problem is constructed and its worst-case bound is analyzed. Computational experiments show that the heuristic algorithm performs well on randomly generated problem instances.