Single machine rescheduling with new jobs arrivals and processing time compression

Yang, Baozhen

doi:10.1007/s00170-006-0590-7

Cited by 43 publications

(17 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They minimise the sum of earliness/tardiness of jobs and manufacturing costs while keeping the absolute difference between completion times of jobs in the new and the original schedule at minimum. Yang (2007) considers new job arrivals to a given schedule on a single machine. As an objective to minimise, Yang (2007) considers three different cost terms.…”

Section: Introductionmentioning

confidence: 99%

“…Yang (2007) considers new job arrivals to a given schedule on a single machine. As an objective to minimise, Yang (2007) considers three different cost terms. The first one is the sum of deviations on the start times of existing jobs, the second term is the total compression cost incurred via processing time control and the third term is one of the two following scheduling related objectives: total completion time and weighted tardiness.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives

Gürel

Cincioğlu

2014

International Journal of Production Research

View full text Add to dashboard Cite

We consider a machine rescheduling problem that arises when a disruption such as machine breakdown occurs to a given schedule. Machine unavailability due to a breakdown requires repairing the schedule as the original schedule becomes infeasible. When repairing a disrupted schedule a desirable goal is to complete each disrupted job on time, i.e. not later than the planned completion time in the original schedule. We consider the case where processing times of jobs are controllable and compressing the processing time of a job requires extra processing cost. Usually, there exists a nonlinear relation between the processing time and manufacturing cost. We solve a bicriteria rescheduling problem that trades off the number of on-time jobs and manufacturing cost objectives. We give a mixed-integer second-order cone programming formulation for the problem. We develop a heuristic search algorithm to generate efficient solutions for the problem. Heuristic algorithm searches solution space by moving and swapping jobs among machines. We develop cost change estimates for job moves and swaps so that the heuristic implements only promising moves and hence generates a set of efficient solutions in reasonably short CPU times.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives

Gürel

Cincioğlu

2014

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…Yang [4] study the single-machine rescheduling with new jobs arrivals and processing time compression. Unal et al [5] consider a single machine with newly arrived jobs that have setup times that depend on their part types.…”

Section: Introductionmentioning

confidence: 99%

Rescheduling problems with deteriorating jobs under disruptions

Zhao

Heng-yong

2010

Applied Mathematical Modelling

View full text Add to dashboard Cite

a b s t r a c tIn this paper, we consider two single-machine rescheduling problems with linear deteriorating jobs under disruption. By a deteriorating jobs, we mean that the actual processing time of the job is an increasing function of its starting time. The two problems correspond to two different increasing linear function. Rescheduling means a set of original jobs has already been scheduled to minimize some classical objective, then a new set of jobs arrives and creates a disruption. We consider the rescheduling problem to minimize the total completion time under a limit of the disruption from the original scheduling. For each problem, we consider two versions. For each version, the polynomial algorithms are proposed, respectively.

show abstract

“…Hall and Potts (2004) and Mocquillon et al (2008) study a problem similar to the previous one, but they measure the disruption of the schedule by means of a cost function. Yang (2007) schedules both new and old jobs considering a disruption cost. Rangsaritratsamee et al (2004) reschedule the set of jobs available in a dynamic job shop at each rescheduling point minimising their makespan.…”

Section: Introductionmentioning

confidence: 99%

Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

González

2010

Computers & Operations Research

View full text Add to dashboard Cite

In this paper we study a due date setting problem in a flowshop layout. The problem consists of scheduling a set of jobs arriving to the system together with jobs already present (denoted as old jobs), in order to set a common due date for the new jobs. Since the old jobs have a common due date that must not be violated, our problem is a rescheduling problem with the objective of minimising the makespan of the new jobs (thus obtaining the tightest possible due date for the new jobs) and a constraint since the maximum tardiness of the old jobs must be equal to zero.This approach leads to an interesting scheduling problem in which two different objectives are considered, each one for a subset of the jobs that must be scheduled.To the best of our knowledge, this type of problems have been scarcely considered in the literature, and only for very specific purposes. Since our problem is clearly NP-hard, a new heuristic based on Variable Neighbourhood Search (VNS) has been designed. The computational results show that our proposed heuristic outperforms two existing heuristic methods for similar problems in the literature. * This is an Accepted Manuscript of an article published by Elsevier in

show abstract

Single machine rescheduling with new jobs arrivals and processing time compression

Cited by 43 publications

References 8 publications

Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives

Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives

Rescheduling problems with deteriorating jobs under disruptions

Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

Contact Info

Product

Resources

About