A study of the multi-stage flowshop scheduling problem with alternative operation assignments

Yoshihiro Futatsuishi, Ichie Watanabe and Toshio Nakanishi

Mathematics and Computers in Simulation (MATCOM), 2002, vol. 59, issue 1, 73-79

Abstract: In small-item large lot production, a single person had only single processing to do. A recent tendency of the production system is the multi-item small lot production. In this type of production system, one work person needs skills that are adaptable to multi-item articles. As the single work person needs more than one skill, one processing operation which comprises a job has come to be handled by several work persons. From the viewpoint of a job, one elementary operation has come to be processed by several alternative operation assignments. We discuss the problem of how to minimize the total elapsed time from the start up time to the completion of a job. In order to solve this problem, we analyze it theoretically under a simpler condition, then we propose an approximation algorithm based on the theoretical analysis applicable to a more general problem.

Keywords: Makespan; Flowshop; Assignment; Scheduling; Sequencing (search for similar items in EconPapers)
Date: 2002
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475401003949
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:59:y:2002:i:1:p:73-79

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().