Preemption in single machine earliness/tardiness scheduling

Bülbül, Kerem; Kaminsky, Philip; Yano, Candace Arai

doi:10.1007/s10951-007-0028-6

Cited by 48 publications

(38 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each instance is denoted as , where is the number of jobs and is the index of the instance in the dataset with jobs. Bülbül et al [22] proposed a method for generating test instances for the single machine earliness/tardiness scheduling problem. We apply this method and add the deadline and setup time generation methods to generate our instances.…”

Section: Data Generationmentioning

confidence: 99%

Hybrid Differential Evolution Optimisation for Earth Observation Satellite Scheduling with Time-Dependent Earliness-Tardiness Penalties

Chen

Yao

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

We study the order acceptance and scheduling (OAS) problem with time-dependent earliness-tardiness penalties in a single agile earth observation satellite environment where orders are defined by their release dates, available processing time windows ranging from earliest start date to deadline, processing times, due dates, sequence-dependent setup times, and revenues. The objective is to maximise total revenue, where the revenue from an order is a piecewise linear function of its earliness and tardiness with reference to its due date. We formulate this problem as a mixed integer linear programming model and develop a novel hybrid differential evolution (DE) algorithm under self-adaptation framework to solve this problem. Compared with classical DE, hybrid DE employs two mutation operations, scaling factor adaptation and crossover probability adaptation. Computational tests indicate that the proposed algorithm outperforms classical DE in addition to two other variants of DE.

show abstract

Section: Data Generationmentioning

confidence: 99%

Hybrid Differential Evolution Optimisation for Earth Observation Satellite Scheduling with Time-Dependent Earliness-Tardiness Penalties

Chen

Yao

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…In the classical one-machine problem with earliness-tardiness where preemption is allowed, each job has two due dates instead of one; one of them deals with the starting time and the other with completion time of jobs (Bülbül et al, 2007;Sourd & Kedad-Sidhoum, 2008;Hendel et al, 2009). Hendel et al (2009) investigated a new single machine scheduling problem with earliness and tardiness to capture the JIT philosophy, where the earliness costs depend on the start times of the jobs and tardiness costs depend on completion times.…”

Section: Literature Reviewmentioning

confidence: 99%

Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process

Kazemi¹,

Nikoofarid²,

Aalaei³

et al. 2012

ijiec

View full text Add to dashboard Cite

This paper considers preemption and idle time are allowed in a single machine scheduling problem with just-in-time (JIT) approach. It incorporates Earliness/Tardiness (E/T) penalties, interruption penalties and holding cost of jobs which are waiting to be processed as work-inprocess (WIP). Generally in non-preemptive problems, E/T penalties are a function of the completion time of the jobs. Then, we introduce a non-linear preemptive scheduling model where the earliness penalty depends on the starting time of a job. The model is liberalized by an elaborately-designed procedure to reach the optimum solution. To validate and verify the performance of proposed model, computational results are presented by solving a number of numerical examples.

show abstract

“…Bülbül et. al [5] also used the same adaptation with better transportation parameters. The resulting lower bound is stronger than the one provided by the LP relaxation of the disjunctive integer programming formulation.…”

Section: B Lower Bound and Upper Bound Proceduresmentioning

confidence: 99%

New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem

Yau

Pan²,

Shi

2008

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

Abstract-This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact nonpreemptive solution in which machine idle time is allowed. In a hybrid approach, we formulate and then solve the problem using dynamic programming (DP) while incorporating techniques from branch-and-bound (BB). This approach (DP-BB) has been proven to be effective in solving certain types of scheduling problems. We further propose a new adaptation of the approach to a general problem with a nonregular objective function. To address some shortcomings of DP-BB, we also apply a branchand-bound approach in which partial dynamic programming dominance (BB-PDP) is exploited. Computational experiments were conducted with randomly generated test instances in order to evaluate the effectiveness of the two approaches. The results clearly showed that our new approaches can solve all the instances with up to 40 jobs and most of the instances with 50 jobs, which outperforms those frequently used approaches in scheduling research.Note to Practitioners-The single-machine scheduling problems with nonregular objective functions are usually harder to solve in comparison to the problems having regular objectives. Most effective algorithms for regular objective problems take advantage of the objective's special feature, which makes it difficult to be applied universally. Sometimes, however, this difficulty can be resolved by changing conventional concepts in the algorithm. This paper addresses a typical nonregular scheduling problem and adopts a technique which has been successfully applied to the regular ones. We extend the traditional concept of "dominance" from one point to piecewise linear so that the technique can be applied to problems with a piecewise linear objective function. Future research can further extend the "linear dominance" to "quadratic dominance" so that this technique can be applied to the single-machine earliness-tardiness problem with a quadratic objective function as well.

show abstract

Preemption in single machine earliness/tardiness scheduling

Cited by 48 publications

References 34 publications

Hybrid Differential Evolution Optimisation for Earth Observation Satellite Scheduling with Time-Dependent Earliness-Tardiness Penalties

Hybrid Differential Evolution Optimisation for Earth Observation Satellite Scheduling with Time-Dependent Earliness-Tardiness Penalties

Just-in-time preemptive single machine problem with costs of earliness/tardiness, interruption and work-in-process

New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem

Contact Info

Product

Resources

About