Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval

2015 ◽  
Vol 32 (3) ◽  
pp. 970-981 ◽  
Author(s):  
Imed Kacem ◽  
Hans Kellerer ◽  
Maryam Seifaddini
Keyword(s):  
Single Machine ◽  
Maximum Lateness ◽  
Approximation Schemes ◽  
Efficient Approximation

A Forward-Backward Procedure for the Single Machine Problem to Minimize Maximum Lateness

1985 ◽  
Vol 17 (3) ◽  
pp. 252-260 ◽  
Author(s):  
R. E. Larson ◽  
M. I. Dessouky ◽  
R. E. Devor
Keyword(s):  
Single Machine ◽  
Maximum Lateness ◽  
Backward Procedure ◽  
Machine Problem

Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times

2008 ◽  
Vol 35 (6) ◽  
pp. 2018-2033 ◽  
Author(s):  
Reha Uzsoy ◽  
Juan Diego Velásquez
Keyword(s):  
Single Machine ◽  
Maximum Lateness ◽  
Set Up

Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work

2016 ◽  
Vol 63 (2) ◽  
pp. 172-183 ◽  
Author(s):  
Yunqiang Yin ◽  
Jianyou Xu ◽  
T. C. E. Cheng ◽  
Chin-Chia Wu ◽  
Du-Juan Wang
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Approximation Schemes ◽  
Late Work ◽  
Maintenance Activity

scholarly journals Scheduling on a Single Machine and Parallel Machines with Batch Deliveries and Potential Disruption

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Hua Gong ◽  
Yuyan Zhang ◽  
Puyu Yuan
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Manufacturing Industry ◽  
Parallel Machines ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Approximation Schemes ◽  
Scheduling Problems ◽  
Delivery Scheduling ◽  
Production Part

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.

Sign in / Sign up

Export Citation Format

Share Document