Two parallel machines problem with job delivery coordination and availability constraint
Coordination and integration among various members of a supply chain has become one of the vital strategies for the modern manufacturers to gain competitive advantages. This paper studies an NP-hard problem of the two-stage scheduling in which jobs are processed by two parallel machines and delivered to the distribution center with the objective of minimizing the makespan. There exists an unavailable interval on one of the machines due to preventive maintenance and an unfinished job can resume processing after the machine becomes available again. Wang and Cheng (Nav Res Logist 54:11–20, 2007) first studied this problem and presented an algorithm H2 with a worst-case ratio of 5/3. This paper proposes a new algorithm which leads to a best possible solution with a worst-case ratio of 3/2.
KeywordsScheduling Supply chain management Complexity theory Heuristic
- Hashemian, N., Diallo, C., & Vizvári, B. (2012). Makespan minimization for parallel machines scheduling with multiple availability constraints. Annals of Operations Research, doi: 10.1007/s10479-012-1059-8.
- Pinedo, M. (1995). Scheduling: Theory, algorithms, and systems. Englewoods Cliffs, NJ: Prentice-Hall.Google Scholar