Scheduling deteriorating jobs to minimize makespan
From MaRDI portal
Publication:4248925
DOI<511::AID-NAV5>3.0.CO;2-6 10.1002/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6zbMath0936.90026OpenAlexW2039692353MaRDI QIDQ4248925
Steef L. van de Velde, Wiesław X. Kubiak
Publication date: 10 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199808)45:5<511::aid-nav5>3.0.co;2-6
single-machine schedulingdynamic programmingdeteriorating jobsbranch and bound algorithmNP-hardnesspseudopolynomial algorithm
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (32)
A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration ⋮ Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs ⋮ Complexity analysis of job-shop scheduling with deteriorating jobs ⋮ An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan ⋮ A note on scheduling on a single processor with speed dependent on a number of executed jobs ⋮ A variant of the permutation flow shop model with variable processing times ⋮ Parallel machine scheduling with time dependent processing times ⋮ A multiple-criterion model for machine scheduling with constant deteriorating jobs ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Scheduling with time-dependent discrepancy times ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs ⋮ A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events ⋮ Parallel-machine scheduling with simple linear deterioration to minimize total completion time ⋮ Single-machine scheduling with deteriorating jobs ⋮ Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem ⋮ Single machine scheduling with step-deteriorating processing times ⋮ Connected searching of weighted trees ⋮ A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance ⋮ An approximation algorithm for parallel machine scheduling with simple linear deterioration ⋮ Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Preemptive repayment policy for multiple loans ⋮ SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE ⋮ Strongly polynomial FPTASes for monotone dynamic programs ⋮ Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
This page was built for publication: Scheduling deteriorating jobs to minimize makespan
