Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
479072 | European Journal of Operational Research | 2007 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha,