Two-machine flow-shop scheduling with rejection

We study a scheduling problem with rejection on a set of two machines in a flow-shop scheduling system. We evaluate the quality of a solution by two criteria: the first is the makespan and the second is the total rejection cost. We show that the problem of minimizing the makespan plus total rejectio...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 39; no. 5; pp. 1087 - 1096
Main Authors:	Shabtay, Dvir, Gasper, Nufar
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier Ltd 01.05.2012 Elsevier Pergamon Press Inc
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximation algorithm Bicriteria optimization Computer science; control theory; systems Exact sciences and technology Flow-shop scheduling formula omitted FPTAS Inventory control, production control. Distribution Job shops Mathematical analysis Mathematical models Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Pareto optimum Production scheduling Pseudo-polynomial time algorithm Rejection Scheduling Scheduling with rejection Scheduling, sequencing Studies Theoretical computing NP-hard Scheduling with rejection Bicriteria optimization Pseudo-polynomial time algorithm Approximation algorithm FPTAS Flow-shop scheduling Costs Multiple machine Pareto optimum Polynomial approximation Scheduling Makespan Optimization Polynomial time Rejection Production management NP hard problem Flow shop Single machine
ISSN:	0305-0548, 1873-765X, 0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!