Premium
Some graph‐theoretical models for scheduling in automated production systems
Author(s) -
de Werra D.,
Solot Ph.
Publication year - 1993
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230230803
Subject(s) - computer science , scheduling (production processes) , job shop scheduling , graph , mathematical optimization , operations research , theoretical computer science , mathematics , schedule , operating system
Variations and extensions of the Open‐Shop Scheduling Problem are presented with an emphasis on models suitable for some automated production systems. Complexity results are given and polynomially solvable cases are described. © 1993 by John Wiley & Sons, Inc.