Abstract
We consider m-machine permutation flow shop problems with an outsourcing option for a special case where each job's processing time equals the job's processing requirement plus a characteristic value of the machine. The objective is to minimize the sum of the performance measure for in-house jobs (the total completion time or the makespan) and the total outsourcing cost. We prove that two problems are polynomially solvable when the number of machines is fixed.
| Original language | English |
|---|---|
| Article number | 1450028 |
| Journal | Asia-Pacific Journal of Operational Research |
| Volume | 31 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Aug 2014 |
Bibliographical note
Funding Information:The second author’s work was supported by a grant from Kyung Hee University in 2012 (KHU-20120561).
Keywords
- Scheduling
- machine-dependent processing times
- outsourcing
- permutation flow shop
Fingerprint
Dive into the research topics of 'Outsourcing decisions in m-machine permutation flow shop scheduling problems with machine-dependent processing times'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver