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

@article{Mnch2006MinimizingEO,
  title={Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint},
  author={Lars M{\"o}nch and Robert Unbehaun and You In Choung},
  journal={OR Spectrum},
  year={2006},
  volume={28},
  pages={177-198}
}
This paper considers a scheduling problem for a single burn-in oven in the semiconductor manufacturing industry where the oven is a batch processing machine with restricted capacity. The batch processing time is set by the longest processing time among those of all the jobs contained in the batch. All jobs are assumed to have the same due date. The objective is to minimize the sum of the absolute deviations of completion times from the due date (earliness–tardiness) of all jobs under the… 
View on Springer
40 Citations
Highly Influential Citations
3
Background Citations
13
Methods Citations
6

40 Citations

Citation Type

Citation Type

Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates
TLDR
The computational results show that the SA algorithm, with initial solution obtained using the own proposed greedy heuristic algorithm, consistently finds a robust solution in a reasonable amount of computation time.
Earliness-tardiness minimization on scheduling a batch processing machine with non-identical job sizes
Hybrid algorithms for the earliness-tardiness single-machine multiple orders per job scheduling problem with a common due date
TLDR
This paper studies an earliness–tardiness scheduling problem for a single machine that is motivated by process conditions found in semiconductor wafer fabrication facilities (wafer fabs) and presents a Mixed Integer Linear Programming (MILP) formulation for this problem.
Minimizing Tardiness Penalty Costs in Job Shop Scheduling under Maximum Allowable Tardiness
TLDR
This study solves a job shop scheduling problem under maximum allowable tardiness, and proposes several dispatching rules that work better than the existing rules and the optimization solver CPLEX, with a time limit.
ACO-based scheduling of parallel batch processing machines to minimize the total weighted tardiness
  • Li Li, F. Qiao, Qidi Wu
  • Business
    2009 IEEE International Conference on Automation Science and Engineering
  • 2009
TLDR
The simulation results showed that the proposed ACO algorithm is superior to a modified Apparent Tardiness Cost-Batched Apparent tardiness cost rule adapted to dynamic job arrivals for minimizing the TWT.
Scheduling a burn-in oven with non-agreeable release times and due dates
TLDR
Four variants of a two-phase greedy heuristic algorithm capable of solving any large-scale real life problems with a relatively low computational effort on a Pentium IV computer are proposed.
Priority Rules for the Single Machine Total Weighted Tardiness Scheduling with Maximum Allowable Tardiness
In many manufacturing or service industries, there exists maximum allowable tardiness for orders. Customers cancel their orders when delivery time exceeds the maximum allowable tardiness whereas they…
A lower bounding method for earliness and tardiness minimization on a single batch processing machine
In this research, the problem of scheduling a single batch processing machine with non-identical job sizes is considered. The objective is to minimize the total earliness and tardiness of all the…
Decomposition heuristics for parallel-machine multiple orders per job scheduling problems with a common due date
Abstract Scheduling problems for identical parallel machines with earliness-tardiness objective are studied that are motivated by manufacturing processes in 300-mm wafer fabs. Wafers are transferred…
...
...

References

SHOWING 1-10 OF 22 REFERENCES
Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
Scheduling with agreeable release times and due dates on a batch processing machine
Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
TLDR
It is proved that the recognition version of this problem is NP-complete in the ordinary sense, and a computationally efficient dynamic programming algorithm is presented that is polynomially solvable.
Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
TLDR
This paper presents an algorithm with a running time of O(m23m), which is independent of B, the maximum batch size, and presents a polynomial heuristic for the general problem (when m is not fixed, which is a two-approximation algorithm).
Minimizing makespan on a single burn-in oven in semiconductor manufacturing
Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
TLDR
This research attempts to minimize total weighted tardiness on parallel batch machines with incompatible job families by proposing two different versions of a genetic algorithm (GA), each consisting of three different phases, and shows that algorithms of the first version of the GA outperform traditional dispatching rules with respect to solution quality and computation time.
Single machine MAD/Tmax problem with a common due date
Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches
Minimizing total completion time on batch processing machines
TLDR
This work provides an exact solution procedure for the single-machine problem and heuristic algorithms for both single and parallel machine problems and shows that the heuristics are capable of consistently obtaining near-optimal solutions in very reasonable CPU times.
Sequencing with Earliness and Tardiness Penalties: A Review
TLDR
A framework to show how results have been generalized starting with a basic model that contains symmetric penalties, one machine and a common due date is provided and such features as parallel machines, complex penalty functions and distinct due dates are added.
...
...