A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
Authors:
- Ada CheACAda Che
- Chengbin ChuCCChengbin Chu
- 31 May 2005
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 33 (3) , 274-284
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A polynomial algorithm for 2-degree cyclic robot schedulingEuropean Journal of Operational Research, 2003
- Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solutionIIE Transactions, 2002
- Part sequencing in three-machine no-wait robotic cellsOperations Research Letters, 2000
- Multiple-part cyclic hoist scheduling using a sieve methodIEEE Transactions on Robotics and Automation, 1999
- Cyclic scheduling of a hoist with time window constraintsIEEE Transactions on Robotics and Automation, 1998
- A strongly polynomial algorithm for no-wait cyclic robotic flowshop schedulingOperations Research Letters, 1997
- An improved algorithm for cyclic flowshop scheduling in a robotic cellEuropean Journal of Operational Research, 1997
- Determining the optimal number of duplicated process tanks in a single-hoist circuit board production lineComputers & Industrial Engineering, 1995
- DETERMINING OPTIMAL CYCLIC HOIST SCHEDULES IN A SINGLE-HOIST ELECTROPLATING LINEIIE Transactions, 1994
- Mathematical Programming Solution of a Hoist Scheduling ProgramA I I E Transactions, 1976