Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint

DOI10.1007/s00291-005-0013-4zbMath1101.90033OpenAlexW2082399357WikidataQ115926719 ScholiaQ115926719MaRDI QIDQ850651

You In Choung, Lars Mönch, Robert Unbehaun

Publication date: 3 November 2006

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-005-0013-4

zbMATH Keywords

SchedulingBurn-in ovenCommon due dateEarliness-tardinessMaximum tardiness constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Capacity allocation in a service system with preferred service completion times ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility ⋮ Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs ⋮ A survey of scheduling with parallel batch (p-batch) processing

Uses Software

• GALib
• Genocop

Cites Work

• Unnamed Item
• Scheduling with agreeable release times and due dates on a batch processing machine
• Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Minimizing total completion time on a batch processing machine with job families
• 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
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
• Scheduling a single batch processing machine with non-identical job sizes
• Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
• Scheduling Groups of Jobs on a Single Machine