Job‐shop scheduling to minimize total waiting time

Chengbin Chu and Marie‐Claude Portmann

Applied Stochastic Models and Data Analysis, 1993, vol. 9, issue 2, 177-185

Abstract: This paper addresses the job‐shop scheduling problem to minimize total waiting time. This also is equivalent to minimizing the work in process. Although, this problem is of relevance to manufacturing systems (Job‐shops), most of the work in the literature concerns the minimization of makespan for which the algorithms proposed are implicit enumeration procedures. For the minimization of total waiting time, to our knowledge, there are only empirical priority rules, all of which construct non‐delay schedules (i.e. there is no inserted idle time on the machines). In this work, we use theoretical results obtained for a single machine scheduling problem to construct an efficient heuristic for the problem at hand. This algorithm provides active schedules that are not always non‐delay schedules. The convergence and the complexity of the algorithm are discussed. The performance is also evaluated with respect to a classical priority rule.

Date: 1993
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/asm.3150090210

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:wly:apsmda:v:9:y:1993:i:2:p:177-185

Access Statistics for this article

More articles in Applied Stochastic Models and Data Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().