Minimizing makespan with multiple-orders-per-job in a two-machine flowshop |
| |
Authors: | Jeffrey D. Laub John W. FowlerAhmet B. Keha |
| |
Affiliation: | Arizona State University, Industrial Engineering, P.O. Box 875906, Tempe, AZ 85287, United States |
| |
Abstract: | We investigate a new scheduling problem, multiple-orders-per-job (MOJ), in the context of a two-machine flowshop. Lower bounds for the makespan performance measure are provided for combinations of lot-processing and item-processing machines. An optimization model is presented that addresses both job formation and job sequencing. We define a heuristic to minimize the makespan for the MOJ problem for two-machine item-processing flowshops. The heuristic obtains solutions within 2% of a tight lower bound and runs in O(HF) time, where H is the number of orders and F is the restricted number of jobs. |
| |
Keywords: | Scheduling Flowshop Multiple-orders-per-job Semiconductor manufacturing |
本文献已被 ScienceDirect 等数据库收录! |