Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
From MaRDI portal
Publication:883302
DOI10.1016/J.COR.2006.02.003zbMATH Open1163.90502OpenAlexW1970380684MaRDI QIDQ883302FDOQ883302
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Scheduling with batching: A review
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Scheduling a batching machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling Groups of Jobs on a Single Machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Scheduling a single batch processing machine with non-identical job sizes
- Minimizing total completion time on a batch processing machine with job families
- Title not available (Why is that?)
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Scheduling with agreeable release times and due dates on a batch processing machine
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- Minimizing the average deviation of job completion times about a common due date
- Title not available (Why is that?)
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Single- and multiple-processor models for minimizing completion time variance
- Earliness and tardiness scheduling problems on a batch processor
Cited In (6)
- Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date
- 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
- 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
- A survey of scheduling with parallel batch (p-batch) processing
Uses Software
Recommendations
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint 👍 👎
- Scheduling a burn-in oven with non-agreeable release times and due dates 👍 👎
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing 👍 👎
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime 👍 👎
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals 👍 👎
This page was built for publication: Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883302)
