Scheduling jobs under simple linear deterioration
From MaRDI portal
Publication:1332800
DOI10.1016/0305-0548(94)90080-9zbMath0810.90074MaRDI QIDQ1332800
Publication date: 17 April 1995
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90080-9
makespan; single machine scheduling; total tardiness; number of tardy jobs; flow-time; simple linear deterioration of processing times
90B35: Deterministic scheduling theory in operations research
Related Items
A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time, A note on scheduling problems with learning effect and deteriorating jobs, A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance, An approximation algorithm for parallel machine scheduling with simple linear deterioration, Minimizing maximum lateness under linear deterioration, Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning, Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan, Two-agent single-machine scheduling problems under increasing linear deterioration, A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration, Single machine quadratic penalty function scheduling with deteriorating jobs and group technology, A branch and bound algorithm for single machine scheduling with deteriorating values of jobs, Scheduling resumable deteriorating jobs on a single machine with non-availability constraints, Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration, A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints, Some single-machine scheduling problems with general effects of learning and deterioration, A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs, Single-machine scheduling problems with time and position dependent processing times, Scheduling with deteriorating jobs and learning effects, Preemptive scheduling with simple linear deterioration on a single machine, Parallel-machine scheduling with deteriorating jobs and rejection, A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration, Parallel-machine scheduling of simple linear deteriorating jobs, Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration, Minimizing total completion time in a two-machine flow shop with deteriorating jobs, Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan, Flow shop scheduling problems with decreasing linear deterioration under dominant machines, Scheduling deteriorating jobs subject to job or machine availability constraints, Flow shop scheduling with effects of learning and deterioration, Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration, Scheduling linear deteriorating jobs with rejection on a single machine, A scheduling problem with job values given as a power function of their completion times, Scheduling time-dependent jobs under mixed deterioration, Learning effect and deteriorating jobs in the single machine scheduling problems, Single machine scheduling with decreasing linear deterioration under precedence constraints, Single machine parallel-batch scheduling with deteriorating jobs, Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration, Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine, Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan, Scheduling jobs under decreasing linear deterioration, Complexity analysis of job-shop scheduling with deteriorating jobs, A note on scheduling on a single processor with speed dependent on a number of executed jobs, A concise survey of scheduling with time-dependent processing times, Minimizing the total weighted completion time of deteriorating jobs, Single machine scheduling problems with deteriorating jobs, Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs, Parallel machine scheduling with time dependent processing times, Single-machine scheduling with both deterioration and learning effects, Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines, Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences, Single machine group scheduling under decreasing linear deterioration, Single-machine group scheduling problems with deterioration consideration, Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times, Parallel-machine scheduling with simple linear deterioration to minimize total completion time, A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times, Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint, Two scheduling problems in group technology with deteriorating jobs, Scheduling in a contaminated area: a model and polynomial algorithms, The single-machine scheduling problems with deteriorating jobs and learning effect, Scheduling linear deteriorating jobs with an availability constraint on a single machine, Pareto and scalar bicriterion optimization in scheduling deteriorating jobs, Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs, A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION, Single machine due-date scheduling of jobs with decreasing start-time dependent processing times, SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE, SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING, Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine, A multiple-criterion model for machine scheduling with constant deteriorating jobs
Cites Work
- Scheduling Deteriorating Jobs on a Single Processor
- V-Shaped Policies for Scheduling Deteriorating Jobs
- Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Simple Optimality Proof of Moore's Sequencing Algorithm
