The complexity of scheduling job families about a common due date

DOI10.1016/S0167-6377(96)00054-5zbMath0890.90111WikidataQ126864231 ScholiaQ126864231MaRDI QIDQ1376265

S. T. Webster

Publication date: 17 December 1997

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

parallel machinesfamily schedulingcomplexity resultscommon due-datenonregular performance measuresetup time structuretotal earliness/tardiness problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (18)

Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics ⋮ Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models ⋮ Just-in-Time Scheduling with Equal-Size Jobs ⋮ An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times ⋮ Scheduling with batching: A review ⋮ Group sequencing around a common due date ⋮ Dynamic programming algorithms for scheduling parallel machines with family setup times ⋮ A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ Earliness-tardiness scheduling with setup considerations ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ Scheduling job families on non-identical parallel machines with time constraints ⋮ The complexity of two group scheduling problems ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research

Cites Work

• Unnamed Item
• Unnamed Item
• Note on “Parallel Machine Scheduling with Batch Setup Times”
• 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
• 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
• New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling independent tasks to reduce mean finishing time
• Parallel Machine Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: The complexity of scheduling job families about a common due date