Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32498
Title: One-operator-two-machine flowshop scheduling with setup and dismounting times
Authors: Cheng, TCE 
Wang, G
Sriskandarajah, C
Keywords: Algorithms
Complexity
Flowshop scheduling
One-operator-two-machine
Issue Date: 1999
Publisher: Pergamon Press
Source: Computers and operations research, 1999, v. 26, no. 7, p. 715-730 How to cite?
Journal: Computers and operations research 
Abstract: In this paper we study the problem of scheduling n jobs in a one-operator-two-machine flowshop. In such a flowshop, before a machine begins processing a job, the operator has to set up the machine, and then the machine can process the job on its own. After a machine finishes processing a job, the operator needs to perform a dismounting operation before setting up the machine for another job. The setup and dismounting operations are either separable or nonseparable. The objective is to minimize the makespan. Confining our study to cyclic-movement schedules which require the operator to move between the two machines according to some cyclic pattern, we show that both the cyclic-movement separable and nonseparable setup and dismounting problems are NP-complete in the strong sense. We then propose some heuristics and analyze their worst-case error bounds. Scope and purpose The one-worker-multiple-machine (OWMM) concept is widely applied in just-in-time (JIT) manufacturing systems. In an OWMM system, a worker tends several machines simultaneously where each of the machines performs a different operation, and the different machines make up a flow line. In this paper, we study a scheduling problem in the one-operator-two-machine system where the operator moves between two machines according to some cyclic pattern, and performs the setup and dismounting operations on both machines. Both separable and nonseparable setup and dismounting problems are considered.In this paper we study the problem of scheduling n jobs in a one-operator-two-machine flowshop. In such a flowshop, before a machine begins processing a job, the operator has to set up the machine, and then the machine can process the job on its own. After a machine finishes processing a job, the operator needs to perform a dismounting operation before setting up the machine for another job. The setup and dismounting operations are either separable or nonseparable. The objective is to minimize the makespan. Confining our study to cyclic-movement schedules which require the operator to move between the two machines according to some cyclic pattern, we show that both the cyclic-movement separable and nonseparable setup and dismounting problems are NP-complete in the strong sense. We then propose some heuristics and analyze their worst-case error bounds.
URI: http://hdl.handle.net/10397/32498
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/S0305-0548(98)00087-2
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

28
Last Week
0
Last month
1
Citations as of Apr 11, 2018

WEB OF SCIENCETM
Citations

23
Last Week
0
Last month
0
Citations as of Apr 18, 2018

Page view(s)

59
Last Week
0
Last month
Citations as of Apr 16, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.