Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
From MaRDI portal
(Redirected from Publication:883302)
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
Cites work
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- Earliness and tardiness scheduling problems on a batch processor
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- 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 makespan on a single burn-in oven in semiconductor manufacturing
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Minimizing the average deviation of job completion times about a common due date
- Minimizing total completion time on a batch processing machine with job families
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Response surface methodology. Process and product optimization using designed experiments
- Scheduling Groups of Jobs on a Single Machine
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- Scheduling a batching machine
- Scheduling a single batch processing machine with non-identical job sizes
- 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
- Scheduling with batching: A review
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single- and multiple-processor models for minimizing completion time variance
Cited in
(7)- 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
- Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
- A survey of scheduling with parallel batch (p-batch) processing
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)
