The role of work-in-process inventory in serial production lines
Operations Research
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
Annals of Operations Research
An effective heuristic for flow shop problems with total flow time as criterion
Proceedings of the 15th annual conference on Computers and industrial engineering
Minimizing Total Completion Time in a Two-Machine
Mathematics of Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
Operations Research
Manufacturing Planning and Control for Supply Chain Management
Manufacturing Planning and Control for Supply Chain Management
Two machine flow shop scheduling problem with weighted WIP costs
Computers and Operations Research
| Hi-index | 0.00 |
A new deterministic flow shop problem is studied where the objective is to minimize the total WIP (work-in-process) cost. Based on a value added model, the unit time WIP cost increases as a job passes through various stages in the production process.The recognition version is unary NP-Complete even for two machines. Several simple and intuitive heuristics are presented. For each heuristic, we determine asymptotically attainable upper bounds on the relative error. Finally, the heuristics are empirically evaluated.