RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN

2007 ◽  
Vol 24 (06) ◽  
pp. 789-796 ◽  
Author(s):  
JINJIANG YUAN ◽  
YUNDONG MU ◽  
LINGFA LU ◽  
WENHUA LI
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Release Dates ◽  
Total Sequence

In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize total sequence disruption under a limit on the makespan. We show that the considered problem can be solved in polynomial time. Consequently, the rescheduling problem for jobs on a single machine with release dates to minimize makespan under a limit on the total sequence disruption can also be solved in polynomial time.

scholarly journals Scheduling Simple Linear Deteriorating Jobs with Rejection

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Juan Zou ◽  
Yuzhong Zhang
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Approximation Scheme ◽  
Deteriorating Jobs ◽  
Release Dates ◽  
Polynomial Time Approximation Scheme ◽  
Machine Model ◽  
Time Approximation ◽  
Total Penalty ◽  
Polynomial Time Approximation

We consider the problems of scheduling deteriorating jobs with release dates on a single machine (parallel machines) and jobs can be rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. For a single machine model, the objective is to minimize the maximum lateness of the accepted jobs plus the total penalty of the rejected jobs. We show that the problem is NP-hard in the strong sense and presents a fully polynomial time approximation scheme to solve it when all jobs have agreeable release dates and due dates. For parallel-machine model, the objective is to minimize the maximum delivery completion time of the accepted jobs plus the total penalty of the rejected jobs. When the jobs have identical release dates, we first propose a fully polynomial time approximation scheme to solve it. Then, we present a heuristic algorithm for the case where all jobs have to be accepted and evaluate its efficiency by computational experiments.

A two-agent single-machine scheduling problem to minimize the total cost with release dates

2015 ◽  
Vol 21 (3) ◽  
pp. 805-816 ◽  
Author(s):  
Du-Juan Wang ◽  
Yunqiang Yin ◽  
Wen-Hsiang Wu ◽  
Wen-Hung Wu ◽  
Chin-Chia Wu ◽  
...  
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Release Dates ◽  
Scheduling Problem ◽  
Total Cost

scholarly journals Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Shuen Guo ◽  
Zhichao Geng ◽  
Jinjiang Yuan
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Approximation Scheme ◽  
Pareto Frontier ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Polynomial Time Approximation Scheme ◽  
Late Work ◽  
Weighting Vector ◽  
Late Works

<p style='text-indent:20px;'>In this paper, we study the single-machine Pareto-scheduling of jobs with multiple weighting vectors for minimizing the total weighted late works. Each weighting vector has its corresponding weighted late work. The goal of the problem is to find the Pareto-frontier for the weighted late works of the multiple weighting vectors. When the number of weighting vectors is arbitrary, it is implied in the literature that the problem is unary NP-hard. Then we concentrate on our research under the assumption that the number of weighting vectors is a constant. For this problem, we present a dynamic programming algorithm running in pseudo-polynomial time and a fully polynomial-time approximation scheme (FPTAS).</p>

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.

scholarly journals Single-Machine Scheduling with Rejection and an Operator Non-Availability Interval

Mathematics ◽  
2019 ◽  
Vol 7 (8) ◽  
pp. 668 ◽  
Author(s):  
Lili Zuo ◽  
Zhenxia Sun ◽  
Lingfa Lu ◽  
Liqi Zhang
Keyword(s):  
Polynomial Time ◽  
Single Machine ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Machine Scheduling ◽  
Total Weighted Completion Time ◽  
Scheduling Problems ◽  
Objective Functions ◽  
Rejection Cost ◽  
Scheduling With Rejection

In this paper, we study two scheduling problems on a single machine with rejection and an operator non-availability interval. In the operator non-availability interval, no job can be started or be completed. However, a crossover job is allowed such that it can be started before this interval and completed after this interval. Furthermore, we also assume that job rejection is allowed. That is, each job is either accepted and processed in-house, or is rejected by paying a rejection cost. Our task is to minimize the sum of the makespan (or the total weighted completion time) of accepted jobs and the total rejection cost of rejected jobs. For two scheduling problems with different objective functions, by borrowing the previous algorithms in the literature, we propose a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme (FPTAS), respectively.

Sign in / Sign up

Export Citation Format

Share Document