Abstract
In this paper, we study several coordinated production-delivery scheduling problems with potential disruption motivated by a supply chain in the manufacturing industry. Both single-machine environment and identical parallel-machine environment are considered in the production part. The jobs finished on the machines are delivered to the same customer in batches. Each delivery batch has a capacity and incurs a delivery cost. There is a situation that a possible disruption in the production part may occur at some particular time and will last for a period of time with a probability. We consider both resumable case and nonresumable case where a job does not need (needs) to restart if it is disrupted for a resumable (nonresumable) case. The objective is to find a coordinated schedule of production and delivery that minimizes the expected total flow times plus the delivery costs. We first present some properties and analyze the NP-hard complexity for four various problems. For the corresponding single-machine and parallel-machine scheduling problems, pseudo-polynomial-time algorithms and fully polynomial-time approximation schemes (FPTASs) are presented in this paper, respectively.
Highlights
Production scheduling and delivery decision are two key operations in the supply chain management
The reasonable scheduling for the disruption affects the revenue in the iron and steel industry. e inventory level and the total delivery cost are the major concerns for the industry managers. e inventory level is measured by a function of the flow time when the finished coils arrive to the customers
For P1 and P2, there exists an optimal schedule that the jobs finished no later than r are sequenced in the shortest processing time (SPT) rule, and the remaining jobs finished after r are sequenced in the SPT rule
Summary
Production scheduling and delivery decision are two key operations in the supply chain management. Lee and Yu [11] considered the single-machine scheduling problems with potential disruptions due to external factors where the objective functions are the expected total weighted completion times and the expected maximum tardiness. We study coordinated scheduling problems with potential disruption and batch deliveries considering single machine or identical parallel machines. We develop coordinated scheduling on the single machine and parallel machines with both batch deliveries and potential disruption in this paper. Both resumable case and nonresumable case are considered in this paper where a job does not need (needs) to restart if it is disrupted for a resumable (nonresumable) case.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
