Parallel machine selection and job scheduling to minimize machine cost and job tardiness

Authors:
Dong Cao;Mingyuan Chen;Guohua Wan
Affiliations:
Department of Mechanical and Industrial Engineering, Concordia University, 1455 de Maisonneuve West, Monetreal, Que., Canada H3G 1M8;Department of Mechanical and Industrial Engineering, Concordia University, 1455 de Maisonneuve West, Monetreal, Que., Canada H3G 1M8;Faculty of Business Administration, University of Macau, Taipa, Macau SAR, China
Venue:
Computers and Operations Research
Year:
2005

Citing 8
Cited 8

Sequencing with earliness and tardiness penalties: a review

Operations Research
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
Parallel machine scheduling with earliness and tardiness penalties

Computers and Operations Research
Tabu Search

Tabu Search
Scheduling unrelated parallel machines to minimize total weighted tardiness

Computers and Operations Research
A tabu search algorithm for parallel machine total tardiness problem

Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Scheduling parallel CNC machines with time/cost trade-off considerations

Computers and Operations Research
Efficiency of Metaheuristics in PMJS_E/T Scheduling Problem

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
Scheduling unrelated parallel machines with optional machines and jobs selection

Computers and Operations Research
Tabu search heuristics for parallel machine scheduling with sequence-dependent setup and ready times

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Optimal semi-online algorithms for scheduling with machine activation cost

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem

Applied Soft Computing
The optimal number of used machines in a two-stage flexible flowshop scheduling problem

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper discusses the problem of simultaneously selecting and scheduling parallel machines to minimize the sum of machine holding cost and job tardiness cost. A combinatorial optimization model is developed for this purpose. Solving the developed model is NP-hard. A heuristic algorithm is developed to locate the optimal or near optimal solutions based on a Tabu search mechanism specially designed to control the search process in the solution neighborhood for jobs scheduled on specific machines. Numerical examples show that the solutions of the model lead to compromises between the system cost related to machine selection and the operational cost related to job tardiness penalties. The examples also show that the developed algorithm is effective and computationally efficient.