Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

Authors:
Jinxing Xie;Xijun Wang
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
2005

Citing 6
Cited 7

An adaptable scheduling algorithm for flexible flow lines

Operations Research
Single machine flow-time scheduling with a single breakdown

Acta Informatica
Two-machine flowshop scheduling with consecutive availability constraints

Information Processing Letters
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Exponential inapproximability and FPTAS for scheduling with availability constraints

Theoretical Computer Science
Makespan Minimization with Machine Availability Constraints

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Review: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Computers and Operations Research
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability

Computers and Industrial Engineering
Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

Computers & Mathematics with Applications
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem

Computers and Operations Research

Quantified Score

Hi-index	0.09

Visualization

Abstract

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem.