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.
Original language | English (US) |
---|---|
Pages (from-to) | 63-79 |
Number of pages | 17 |
Journal | European Journal of Operational Research |
Volume | 182 |
Issue number | 1 |
DOIs | |
State | Published - Oct 1 2007 |
Keywords
- Flowshop
- Multiple-orders-per-job
- Scheduling
- Semiconductor manufacturing
ASJC Scopus subject areas
- General Computer Science
- Modeling and Simulation
- Management Science and Operations Research
- Information Systems and Management