Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Authors:
Kai Li;Ye Shi;Shan-lin Yang;Ba-yi Cheng
Affiliations:
School of Management, Hefei University of Technology, Hefei 230009, PR China and Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, Hefei 230009, PR Chi ...;School of Management, Hefei University of Technology, Hefei 230009, PR China;School of Management, Hefei University of Technology, Hefei 230009, PR China and Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, Hefei 230009, PR Chi ...;School of Management, Hefei University of Technology, Hefei 230009, PR China and Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, Hefei 230009, PR Chi ...
Venue:
Applied Soft Computing
Year:
2011

Citing 13
Cited 3

A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

Discrete Applied Mathematics
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard

Information Processing Letters
Single machine scheduling with a variable common due date and resource-dependent processing times

Computers and Operations Research
Convex resource allocation for minimizing the makespan in a single machine with job release dates

Computers and Operations Research
Approximation schemes for parallel machine scheduling problems with controllable processing times

Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

Computers and Operations Research
Task Scheduling in a Finite-Resource, Reconfigurable Hardware/Software Codesign Environment

INFORMS Journal on Computing
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources

Computers and Industrial Engineering
A hybrid immune simulated annealing algorithm for the job shop scheduling problem

Applied Soft Computing
Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan

Knowledge-Based Systems

Genetic algorithms for a two-agent single-machine problem with release time

Applied Soft Computing
A simulated annealing heuristic for minimizing makespan in parallel machine scheduling

SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers the identical parallel machine scheduling problem to minimize the makespan with controllable processing times, in which the processing times are linear decreasing functions of the consumed resource. The total resource consumption is limited. This problem is NP-hard even if the total resource consumption equals to zero. Two kinds of machines, critical machine and non-critical machine, are defined. Some theoretical results are provided. And then, a simulated annealing algorithm is designed to obtain the near-optimal solutions with high quality. To evaluate the performance of the proposed algorithm, we generate the random test data in our experiment to simulate the ingot preheating before hot-rolling process in steel mills. The accuracy and efficiency of the simulated annealing algorithm is tested based on the data with problem size varying from 200 jobs to 1000 jobs. By examining 10,000 randomly generated instances, the proposed simulated annealing algorithm shows an excellent performance in not only the solution quality but also the computation time.