A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

DOI10.1016/S0305-0548(03)00117-5zbMath1068.90561WikidataQ58839309 ScholiaQ58839309MaRDI QIDQ1885972

Georgios C. Anagnostopoulos, Ghaith Rabadi, Mansooreh Mollaghasemi

Publication date: 12 November 2004

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

zbMATH Keywords

Branch-and-boundCommon due dateSingle-machine schedulingEarly/tardyEarliness/tardinessSequence-dependent setup times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times, A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times, A differential evolution approach for the common due date early/tardy job scheduling problem, A survey of scheduling problems with setup times or costs, Earliness-tardiness scheduling with setup considerations, A Meta-RaPS for the early/tardy single machine scheduling problem, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Some dominance properties for single-machine tardiness problems with sequence-dependent setup, Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry, Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

Uses Software

• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling with batch setup times and earliness-tardiness penalties
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• The weighted common due date single machine scheduling problem revisited
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing mean absolute deviation of completion times about a common due date
• Single- and multiple-processor models for minimizing completion time variance
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Scheduling job families about an unrestricted common due date on a single machine
• Single machine weighted earliness-tardiness penalty problem with a common due date
• A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times