Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date

DOI10.1016/j.cor.2006.02.003zbMath1163.90502OpenAlexW1970380684MaRDI QIDQ883302

Lars Mönch, Robert Unbehaun

Publication date: 4 June 2007

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

Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.003

zbMATH Keywords

heuristicsschedulingearliness-tardinesscommon due dateparallel burn-in ovens

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Exact and heuristic algorithms for the just-in-time scheduling problem in a batch processing system ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Parallel batching with multi-size jobs and incompatible job families ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ A survey of scheduling with parallel batch (p-batch) processing

Uses Software

• GALib
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
• Scheduling a batching machine
• 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
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Earliness and tardiness scheduling problems on a batch processor
• Scheduling with batching: A review
• 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
• Single- and multiple-processor models for minimizing completion time variance
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• 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
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

This page was built for publication: Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date