ON THE COMPLEXITY OF THE PROCESS SHOP

Authors
RAMUDHIN A RATLIFF HD
Citation
A. Ramudhin et Hd. Ratliff, ON THE COMPLEXITY OF THE PROCESS SHOP, INFOR. Information systems and operational research, 32(2), 1994, pp. 99-109
Citations number
NO
Categorie Soggetti
Operatione Research & Management Science
Journal title
INFOR. Information systems and operational research → ACNP
ISSN journal
03155986
Volume
32
Issue
2
Year of publication
1994
Pages
99 - 109
Database
ISI
SICI code
0315-5986(1994)32:2<99:OTCOTP>2.0.ZU;2-8
Abstract
We consider the problem of scheduling a two-stage processing system wh ere each stage consists of a set of independent parallel processors. A job requires processing on a processor from each set and no-wait sche dules are required. We show that this problem is hard for it generaliz es jobshop and flowshop scheduling. This observation provides a new co nceptual framework for process scheduling and allows us to identify se veral solvable special cases.