Scheduling linear deteriorating jobs to minimize the number of tardy jobs

DOI10.1007/s10898-011-9767-1zbMath1259.90035OpenAlexW2063888542MaRDI QIDQ693149

Ghasem Moslehi, Abbas-Ali Jafari

Publication date: 7 December 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9767-1

zbMATH Keywords

branch and boundnumber of tardy jobslinear deteriorating jobs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times ⋮ Patient scheduling with periodic deteriorating maintenance on single medical device ⋮ Parallel machine scheduling with general sum of processing time based models ⋮ A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs ⋮ Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ A note on the complexity of scheduling problems with linear job deterioration

Cites Work

• The complexity of scheduling starting time dependent tasks with release times
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.
• Minimizing the total weighted completion time of deteriorating jobs
• Minimizing the weighted number of tardy jobs on a single machine
• Single-machine scheduling with logarithm deterioration
• An exact method to minimize the number of tardy jobs in single machine scheduling
• Parallel-machine scheduling under potential disruption
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Scheduling Deteriorating Jobs on a Single Processor
• Complex Scheduling
• Scheduling jobs with position-dependent processing times
• Minimizing maximum lateness under linear deterioration

This page was built for publication: Scheduling linear deteriorating jobs to minimize the number of tardy jobs