A branch and bound algorithm for single machine scheduling with deteriorating values of jobs

DOI10.1016/j.mcm.2009.12.024zbMath1201.90087MaRDI QIDQ611733

Theodore G. Voutsinas, Costas P. Pappis

Publication date: 14 December 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2009.12.024

zbMATH Keywords

scheduling; deteriorating jobs; branch and bound method; deteriorating values

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs, Single-machine scheduling problems with an actual time-dependent deterioration, Single-machine group scheduling problems with deterioration to minimize the sum of completion times, Single-machine scheduling with past-sequence-dependent setup times and general effects of deterioration and learning, Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times

Cites Work

• Unnamed Item
• Single processor scheduling with job values depending on their completion times
• A scheduling problem with job values given as a power function of their completion times
• Scheduling jobs under simple linear deterioration
• A concise survey of scheduling with time-dependent processing times
• Minimizing the total weighted completion time of deteriorating jobs
• Batching work and rework processes with limited deterioration of reworkables
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling jobs with piecewise linear decreasing processing times
• Scheduling start time dependent jobs to minimize the total weighted completion time