A note on single-processor scheduling with time-dependent execution times
From MaRDI portal
Publication:1905074
DOI10.1016/0167-6377(94)00058-EzbMath0841.90072MaRDI QIDQ1905074
Publication date: 16 January 1996
Published in: Operations Research Letters (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ 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 ⋮ An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs ⋮ An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan ⋮ Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Minimizing total load on parallel machines with linear deterioration ⋮ Parallel machine scheduling with time dependent processing times ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Some single-machine and flowshop scheduling problems with a non-linear deterioration function ⋮ A single-machine scheduling with a truncated linear deterioration and ready times ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ Greedy solutions of selection and ordering problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
Cites Work
