Machine Scheduling with Availability and Transportation Considerations  
Author Jason Chao-Hsien Pan


Co-Author(s) Chi-Shiang Su


Abstract 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 [9] 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.


Keywords scheduling, supply chain management, complexity theory, heuristic
    Article #:  2165
Proceedings of the 21st ISSAT International Conference on Reliability and Quality in Design
August 6-8, 2015 - Philadelphia, Pennsylvia, U.S.A.