A branch and bound approach for single machine scheduling with earliness and tardiness penalties

DOI10.1016/S0898-1221(99)00130-3zbMATH Open0931.90013OpenAlexW2013137873MaRDI QIDQ1963033FDOQ1963033

Authors: Pei-Chann Chang 

Publication date: 20 January 2000

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00130-3

Recommendations

• The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
• Single machine scheduling with symmetric earliness and tardiness penalties
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• scientific article; zbMATH DE number 3904315
• A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine

zbMATH Keywords

complexitysingle machine schedulingbranch and bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Single-machine scheduling with early and tardy completion costs
• A decomposition algorithm for the single machine total tardiness problem
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• The Single Machine Early/Tardy Problem
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Minimizing mean absolute 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
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution

Cited In (14)

• EA/G-GA for single machine scheduling problems with earliness/tardiness costs
• Single machine scheduling with flow time and earliness penalties
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Single machine scheduling with symmetric earliness and tardiness penalties
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• Title not available (Why is that?)
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• Bi-objective single machine scheduling problem with stochastic processing times

This page was built for publication: A branch and bound approach for single machine scheduling with earliness and tardiness penalties

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