Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints
JOURNAL OF MATHEMATICAL MODELLING AND ALGORITHMS ; 12 , 1 ; 85-99
01.01.2013
15 pages
Aufsatz (Zeitschrift)
Englisch
DDC: | 003.3 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Minimizing the Number of Tardy Jobs in Flow Shop Sequence Dependent Setup Times Scheduling Problem
British Library Conference Proceedings | 2012
|JOBS SCHEDULING WITH EARLY-TARDY PENALTIES IN MANUFACTURING SYSTEMS
British Library Conference Proceedings | 2004
|Scheduling for flowshop problem
British Library Online Contents | 1995
|A decentralized scheduling method for flowshop problems with resource constraints
Online Contents | 2004
|Heuristics for single machine scheduling problem with family setup times
British Library Online Contents | 2017
|