Scheduling with job release dates, delivery times and preemption penalties

Liu, Zhaohui; Cheng, T.C.E.

doi:10.1016/s0020-0190(01)00251-4

Cited by 31 publications

(12 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This scaling technique has been already successfully applied to design a fully polynomial approximation schedule for 0-1 Knapsack problem (see [21]). There are recent applications of this scaling technique for some scheduling problems (for example, [22,23]). In this paper, we formulate a scaled problem for TBS and prove that any efficient algorithm for the scaled problem is a 1+e-approximation algorithm for the original problem TBS.…”

Section: An Fptasmentioning

confidence: 99%

The coordination of transportation and batching scheduling

Tang

Gong

2009

Applied Mathematical Modelling

View full text Add to dashboard Cite

a b s t r a c tWe study a coordinated scheduling problem of production and transportation in which each job is transported to a single batching machine for further processing. There are m vehicles that transport jobs from the holding area to the batching machine. Each vehicle can transport only one job at a time. The batching machine can process a batch of jobs simultaneously where there is an upper limit on the batch size. Each batch to be processed occurs a processing cost. The problem is to find a joint schedule of production and transportation such that the sum of the total completion time and the total processing cost is optimized. For a special case of the problem where the job assignment to the vehicles is predetermined, we provide a polynomial time algorithm. For the general problem, we prove that it is NP-hard (in the ordinary sense) and present a pseudo-polynomial time algorithm. A fully polynomial time approximation scheme for the general problem is obtained by converting an especially designed pseudo-polynomial dynamic programming algorithm.Crown

show abstract

Section: An Fptasmentioning

confidence: 99%

The coordination of transportation and batching scheduling

Tang

Gong

2009

Applied Mathematical Modelling

View full text Add to dashboard Cite

show abstract

“…They are modeled as set-up costs or as a preemption model where after preemption a portion of the job must be re-executed; see e.g. [5,6,3].…”

Section: Previous Workmentioning

confidence: 99%

Lower bounds on online deadline scheduling with preemption penalties

Fung

2008

Information Processing Letters

View full text Add to dashboard Cite

“…Monma and Potts [2] and Chen [3] suggested the heuristics for parallel machine scheduling problem subject to preemption and batch setup times. Zdrzalka [4], Schuurman and Woeginger [5], and Liu and Cheng [6] studied preemptive scheduling with job release dates and job-dependent setup times. Julien et al [7] proposed generalized preemption models for single-machine dynamic scheduling problems.…”

Section: Introductionmentioning

confidence: 99%

Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty

Afshar-Nadjafi

2014

Advances in Operations Research

View full text Add to dashboard Cite

Extensive research works have been carried out in resource constrained project scheduling problem. However, scarce researches have studied the problems in which a setup cost must be incurred if activities are preempted. In this research, we investigate the resource constrained project scheduling problem to minimize the total project cost, considering earliness-tardiness and preemption penalties. A mixed integer programming formulation is proposed for the problem. The resulting problem is NP-hard. So, we try to obtain a satisfying solution using simulated annealing (SA) algorithm. The efficiency of the proposed algorithm is tested based on 150 randomly produced examples. Statistical comparison in terms of the computational times and objective function indicates that the proposed algorithm is efficient and effective.

show abstract

Scheduling with job release dates, delivery times and preemption penalties

Cited by 31 publications

References 4 publications

The coordination of transportation and batching scheduling

The coordination of transportation and batching scheduling

Lower bounds on online deadline scheduling with preemption penalties

Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty

Contact Info

Product

Resources

About