No-wait flexible flowshop scheduling with no-idle machines

Authors:
Zhenbo Wang;Wenxun Xing;Fengshan Bai
Affiliations:
Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China;Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China;Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China
Venue:
Operations Research Letters
Year:
2005

Citing 1
Cited 4

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

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

Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
A genetic algorithm-based scheduler for multiproduct parallel machine sheet metal job shop

Expert Systems with Applications: An International Journal
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

Computers and Operations Research
On Eulerian extensions and their application to no-wait flowshop scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds.