Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling

This paper describes the development of a mixed binary integer programming (BIP) model for scheduling alternative operations in two-machine flow-shop problems with mean tardiness as the criterion. Although the mixed BIP model provides an optimal solution, its variables and constraints increase drast...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science 2005-10, Vol.36 (12), p.757-766
Main Authors: Chen, J.-S., Pan, J. C.-H.
Format: Article
Language:English
Subjects:
Alternative operations
Applied sciences
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling
Scheduling, sequencing
System theory
Tardiness
Two-machine flow-shop
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes the development of a mixed binary integer programming (BIP) model for scheduling alternative operations in two-machine flow-shop problems with mean tardiness as the criterion. Although the mixed BIP model provides an optimal solution, its variables and constraints increase drastically as the number of jobs increases. Therefore, an optimal solution is not always attainable within the allowable time by solving the mixed BIP model. Consequently, two heuristics suitable for the formulated scheduling problems are proposed. Computational experiments are conducted to test the accuracy and efficiency of the heuristics in generating near optimal solutions for minimising the mean tardiness of jobs.
ISSN:0020-7721
1464-5319
DOI:10.1080/00207720500219237