Makespan minimization in single-machine scheduling with step-deterioration of processing times (original) (raw)

Computers & Mathematics With Applications, 2007

Single-machine scheduling with deteriorating jobs

International Journal of Systems Science, 2010

On a generalized single machine scheduling problem with time-dependent processing times

Frank Werner

Scheduling with step-improving processing times

Han Hoogeveen, T. C. E. Cheng

Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan

European Journal of Operational Research, 2010

A polynomially solvable case of a single machine scheduling problem when the maximal job processing time is a constant

Frank Werner

IFAC Proceedings Volumes (IFAC-PapersOnline), 2012

The Optimality Region for a Single-Machine Scheduling Problem with Bounded Durations of the Jobs and the Total Completion Time Objective

Yuri Sotskov

Mathematics

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times

Chengbin Chu

Computers & Operations Research, 2008

Minimizing Maximum Lateness of Jobs with Naturally Bounded Job Data on a Single Machine in Polynomial Time

Frank Werner, Nodari Vakhania

Theoretical Computer Science, Vol. 501, 2013, 72 -81.

Single machine scheduling with discretely controllable processing times

Qing Lu, Zhi-long Chen

Operations Research Letters, 1997

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals

Zhibin Jiang

Computers & Operations Research, 2012

Scheduling Jobs with Equal Processing Times on a Single Machine: Minimizing Maximum Lateness and Makespan 1

Frank Werner

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science, 2004

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Operations Research Letters, 2008

A dynamic programming algorithm for the single machine total completion time scheduling problem with availability constraints

Bernard Penz

Single machine batch scheduling with sequential job processing

IIE Transactions, 2001

Minimizing the makespan in a single machine scheduling problem with a time-based learning effect

Information Processing Letters, 2006

Minimizing Makespan on Single Machine with Release Dates

Ayodeji Oluleye, Elkanah Oyetunji

International Journal of Advancements in …, 2011

A Polynomial Algorithm for Special Case of the One-Machine Scheduling Problem with Time-Lags

HELENA RAMALHINHO DIAS LOURENÇO

SSRN Electronic Journal, 1999

Single-machine scheduling with past-sequence-dependent delivery times and release times

Ming Liu

2012

Scheduling deteriorating jobs to minimize makespan

Wieslaw Kubiak

Naval Research Logistics, 1998

Optimal algorithms for single-machine scheduling with rejection to minimize the makespan

Daniel Ng

Int J Prod Econ, 2011

A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags

Peter Brucker, Johann Hurink

Discrete Applied Mathematics, 1999

Theoretical and practical issues in single-machine scheduling with two job release and delivery times

Nodari Vakhania

Journal of Scheduling

Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

Chin-chia Wu, T. C. E. Cheng, Dar-Li Yang

2010

A dynamic programming algorithm for the single machine total completion time scheduling problem with availability

Bernard Penz

Resource optimal control in some single-machine scheduling problems

IEEE Transactions on Automatic Control, 1994

Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times

2012

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

Journal of Scheduling, 2006