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

DOI10.1016/0305-0548(95)00008-AMaRDI QIDQ2563889zbMATH OpenFDO

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

Publication date 5 October 1997

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

Full work available at URL https://doi.org/10.1016/0305-0548(95)00008-A

zbMATH Keywords

branch and bounddecompositiondominancemean absolute lateness single machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling to minimize mean absolute lateness: A heuristic solution
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure

Cites work

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

Cited in

(10)

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

This page was built for publication: A branch and bound procedure to minimize mean absolute lateness on a single processor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563889)