Structural properties of time-dependent scheduling problems with the l norm objective

Gawiejnowicz, Stanisław; Kurc, Wiesław

doi:10.1016/j.omega.2015.04.015

Cited by 6 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For general case of problem (P), Ocetkiewicz (2013) proposed a branch-and-bound algorithm. Gawiejnowicz and Kurc (2015) shown that counterparts of Property 3 also hold for time-dependent scheduling problems with more general criterion functions than the total completion time, considering a generalization of problem (P) with the objective to minimize the l p norm…”

Section: Previous Research On Problem (P)mentioning

confidence: 99%

New results for an open time-dependent scheduling problem

Gawiejnowicz

Kurc

2020

J Sched

Self Cite

View full text Add to dashboard Cite

We present several new results for a single machine time-dependent scheduling problem of minimizing the total completion time of a set of linearly deteriorating jobs with unit basic processing times. First, we show new properties of cyclic transformations of V-shaped sequences for this problem. Next, applying the results, we prove a new necessary condition of schedule optimality for the considered problem, which decreases the previous bound on the cardinality of the set containing all possible optimal schedules by a multiplicative factor which is at most proportional to the reciprocal of the square root of the number of jobs. Finally, we compare the strength of the new and the previous necessary conditions by estimation of the numbers of schedules satisfying the respective conditions.

show abstract

Section: Previous Research On Problem (P)mentioning

confidence: 99%

New results for an open time-dependent scheduling problem

Gawiejnowicz

Kurc

2020

J Sched

Self Cite

View full text Add to dashboard Cite

show abstract

“…This study is the only monograph on scheduling under deterioration. A series of results on deteriorating jobs were subsequently obtained (Gawiejnowicz and Kononov 2010;Gawiejnowicz and Lin 2010;Gawiejnowicz et al 2011;Gawiejnowicz and Suwalski 2014;Gawiejnowicz and Kurc 2015). Zhang and Luo (2013) studied a two-parallel-machine scheduling problem with deteriorating jobs, and a fully polynomial-time approximation scheme was proposed.…”

Section: Introductionmentioning

confidence: 99%

An uncertain parallel machine problem with deterioration and learning effect

Shen

2019

Comp. Appl. Math.

View full text Add to dashboard Cite

An uncertain uniform parallel machine scheduling problem with job deterioration and a learning effect is considered. Job processing times, due dates, deterioration rates and learning rates are assumed to be uncertain variables. The objective functions are the total weight earliness, tardiness and makespan. Three mathematical programming models are presented, i.e., expected value model, pessimistic value model and measure chance model. These models can be converted into equivalent crisp models by the inverse uncertainty distribution method. A hybrid algorithm mixed with dispatching rules based on structural features is employed to solve the problem. Finally, computational experiments are presented to illustrate the effectiveness of proposed algorithms.

show abstract

A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Gawiejnowicz

2020

J Sched

View full text Add to dashboard Cite

Structural properties of time-dependent scheduling problems with the l norm objective

Cited by 6 publications

References 27 publications

New results for an open time-dependent scheduling problem

New results for an open time-dependent scheduling problem

An uncertain parallel machine problem with deterioration and learning effect

A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Contact Info

Product

Resources

About