A branch and bound procedure to minimize mean absolute lateness on a single processor

DOI10.1016/0305-0548(95)00008-AzbMath0871.90046MaRDI QIDQ2563889

Kenneth Darby-Dowman, Ronald D. Armstrong, Patrick R. Philipoom, Timothy D. Fry

Publication date: 5 October 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

decompositionbranch and bounddominancemean absolute lateness single machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Preemption in single machine earliness/tardiness scheduling, A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, Counting and enumeration complexity with application to multicriteria scheduling, Single machine scheduling to minimize mean absolute lateness: A heuristic solution, Minimizing earliness and tardiness costs in stochastic scheduling

Cites Work

• A decomposition algorithm for the single machine total tardiness problem
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Variance Minimization in Single Machine Sequencing Problems