Search
Abstract
In the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule). Moreover, in any feasible schedule we require some predetermined delays between the subsequent operations of the same job (no delays in the no-wait restriction) and each machine is working without any idle time (no-idle restriction). Although the open shop scheduling problem is NP-hard in general, we show some polynomial time algorithms using chromatic scheduling models for the selected open shop scheduling problems.
Authors (2)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Journal of Theoretical and Applied Computer Science
no. 11,
pages 20 - 27,
ISSN: 2299-2634 - Language:
- English
- Publication year:
- 2017
- Bibliographic description:
- Małafiejski M., Pastuszak K.: Restricted open shop scheduling// Journal of Theoretical and Applied Computer Science. -Vol. 11., nr. 1 (2017), s.20-27
- Verified by:
- Gdańsk University of Technology
seen 133 times
Recommended for you
Approximation algorithms for job scheduling with block-type conflict graphs
- H. Furmańczyk,
- T. Pikies,
- I. Sokołowska
- + 1 authors