The Fixed Job Schedule Problem with Working-Time Constraints

Matteo Fischetti, Silvano Martello and Paolo Toth
Additional contact information
Matteo Fischetti: University of Bologna, Bologna, Italy
Silvano Martello: University of Bologna, Bologna, Italy
Paolo Toth: University of Bologna, Bologna, Italy

Operations Research, 1989, vol. 37, issue 3, 395-403

Abstract: We consider a generalization of the fixed job schedule problem where a bound is imposed on the total working time of each processor. It is shown that the problem is NP-hard but polynomially solvable in the preemptive case. We introduce several lower bounds. One is determined through definition of a special class of graphs, for which the maximum clique problem is shown to be polynomial. Lower bounds and dominance criteria are exploited in a branch-and-bound algorithm for optimal solution of the problem. The effectiveness of the algorithm is analyzed through computational experiments.

Keywords: production/scheduling: fixed job scheduling; programming; algorithms; branch-and-bound: lower bounds (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.3.395 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:3:p:395-403

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().