Priority rules for job shops with weighted tardiness costs
Management Science
A survey of algorithms for the single machine total weighted tardiness scheduling problem
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
Scheduling parallel machines to minimize total weighted and unweighted tardiness
Computers and Operations Research
A performance comparison of heuristics for the total weighted tardiness problem
Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Scheduling jobs on parallel machines applying neural network and heuristic rules
Computers and Industrial Engineering
Intelligent Scheduling Systems
Intelligent Scheduling Systems
Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling
Journal of Scheduling
Design and Analysis of Experiments
Design and Analysis of Experiments
A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
Journal of Scheduling
A multi-criteria optimization framework for industrial shop scheduling using fuzzy set theory
Integrated Computer-Aided Engineering
Scheduling algorithms for a semiconductor probing facility
Computers and Operations Research
A two-stage hybrid memetic algorithm for multiobjective job shop scheduling
Expert Systems with Applications: An International Journal
Integrating parts design characteristics and scheduling on parallel machines
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
Rule-based scheduling in wafer fabrication with due date-based objectives
Computers and Operations Research
Evolving priority scheduling heuristics with genetic programming
Applied Soft Computing
Computers and Industrial Engineering
Proceedings of the Winter Simulation Conference
Minimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates
International Journal of Applied Evolutionary Computation
| Hi-index | 0.01 |
In this research we are interested in scheduling jobs with ready times on identical parallel machines with sequence dependent setups. Our objective is to minimize the total weighted tardiness. As this problem is NP-Hard, we develop a heuristic to solve this problem in reasonable time. Our approach is an extension of the apparent tardiness cost with setups (ATCS) approach by [Lee, Y. H., Pinedo, M. (1997). Scheduling jobs on parallel machines with sequence dependent setup times. European Journal of Operational Research, 100, 464-474.] to allow non-ready jobs to be scheduled - meaning we allow a machine to remain idle for a high priority job arriving at a later time. To determine the scaling parameters for our composite dispatching rule (called ATCSR), we first develop a 'grid approach' that considers multiple values for the scaling parameters, generates multiple schedules, and chooses the best schedule for the solution. This experimentation was then used to develop regression equations to predict the values of the scaling parameters that would yield the highest quality solution. The grid and regression versions of ATCSR provide better performance than grid and empirically based formula versions of ATCS, BATCS, and X-RM which are the prominent algorithms in the literature.