Research Article
A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan
Article first published online: 7 NOV 2002
DOI: 10.1002/jos.119
Copyright © 2002 John Wiley & Sons, Ltd.
Issue
1099-1425/asset/cover.gif?v=1&s=713a24f62f0b2a40d4934d3c654feda368b1d6fd "Journal of Scheduling")
Journal of Scheduling
Special Issue: Special Issue of Selected Papers from the Dagstuhl Workshop on Scheduling in Computer and Manufacturing Systems
Volume 5, Issue 6, pages 487–499, November/December 2002
Additional Information
How to Cite
Józefowska, J., Mika, M., Różycki, R., Waligóra, G. and Węglarz, J. (2002), A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan. J. Sched., 5: 487–499. doi: 10.1002/jos.119
Publication History
- Issue published online: 7 NOV 2002
- Article first published online: 7 NOV 2002
Funded by
- State Committee for Scientific Research, Poland. Grant Number: 8T11A 02016
- Abstract
- References
- Cited By
Keywords:
- discrete–continuous scheduling;
- makespan;
- mathematical programming problem;
- heuristic;
- tabu search
Abstract
A problem of scheduling jobs on parallel, identical machines under an additional continuous resource to minimize the makespan is considered. Jobs are non-preemtable and independent and all are available at the start of the process. The total amount of the continuous resource available at a time is limited and the resource is a renewable one. Each job simultaneously requires for its processing a machine and an amount (unknown in advance) of the continuous resource. The processing rate of a job depends on the amount of the resource allotted to this job at a time. The problem is to find a sequence of jobs on machines and, simultaneously, a continuous resource allocation which minimize the makespan. A heuristic approach to allocating the continuous resource is proposed. A tabu search algorithm to solve the considered problem is presented and the results for the algorithms with exact and heuristic procedures for allocating the continuous resource are compared on the basis of some computational experiments. Copyright © 2002 John Wiley & Sons, Ltd.