Two machine flow shop scheduling problem with weighted WIP costs

Authors:
Jaehwan Yang
Affiliations:
School of Business Administration, University of Seoul, 90 Jeonnong-dong, Dongdaemun-gu, Seoul 130-743, Korea
Venue:
Computers and Operations Research
Year:
2009

Citing 5
Cited 0

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
Minimizing Total Completion Time in a Two-Machine

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
Flow shops with WIP and value added costs

Journal of Scheduling

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper considers two new machine flow shop scheduling problems where the objective is to minimize the total WIP (work-in-process) cost. In this type of problems, the unit time WIP cost increases or decreases as a job passes through a series of stages in the production process. We first introduce this relatively new class of flow shop scheduling problems. Then, we establish the complexity of several problems with different types of job restrictions and weighted cost characteristics. For some tractable cases, we propose optimal solution procedures. Finally, a heuristic is introduced for a class of problem instances, and we find upper bounds on the relative errors.