Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines

Authors:
Lars Mönch;Jens Zimmermann;Peter Otto
Affiliations:
Institute of Information Systems, Technical University of Ilmenau, 98684 Ilmenau, Germany;Department of System Analysis, Technical University of Ilmenau, 98684 Ilmenau, Germany;Department of System Analysis, Technical University of Ilmenau, 98684 Ilmenau, Germany
Venue:
Engineering Applications of Artificial Intelligence
Year:
2006

Citing 7
Cited 7

Priority rules for job shops with weighted tardiness costs

Management Science
Scheduling jobs on parallel machines applying neural network and heuristic rules

Computers and Industrial Engineering
Scheduling a batch processing machine with incompatible job families

Computers and Industrial Engineering
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure

Computers and Operations Research
A genetic algorithm to minimize maximum lateness on a batch processing machine

Computers and Operations Research
Incremental Induction of Decision Trees

Machine Learning
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times

Computers and Operations Research

ACO-Based Scheduling of Parallel Batch Processing Machines with Incompatible Job Families to Minimize Total Weighted Tardiness

ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
A survey of challenges in modelling and decision-making for discrete event logistics systems

Computers in Industry
A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times

Expert Systems with Applications: An International Journal
A GRASP approach for makespan minimization on parallel batch processing machines

Journal of Intelligent Manufacturing
Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times

Computers and Industrial Engineering
A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines

Journal of Intelligent Manufacturing
Survey: Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms: Review and opportunity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication facilities, where the machines can be modeled as parallel batch processors. Total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs is attempt to minimize. Given that the problem is NP hard, a simple heuristic based on the Apparent Tardiness Cost (ATC) Dispatching Rule is suggested. Using this rule, a look-ahead parameter has to be chosen. Because of the appearance of unequal ready times and batch machines it is hard to develop a closed formula to estimate this parameter. The use of inductive decision trees and neural networks from machine learning is suggested to tackle the problem of parameter estimation. The results of computational experiments based on stochastically generated test data are presented. The results indicate that a successful choice of the look-ahead parameter is possible by using the machine learning techniques.