A Method of Flow-Shop Re-Scheduling Dealing with Variation of Productive Capacity
We can make optimum scheduling results using various methods that are proposed by many researchers. However, it is very difficult to process the works on time without delaying the schedule. There are two major causes that disturb the planned optimum schedules; they are (1)the variation of productive...
Main Authors: | Kenzo KURIHARA, Yusuke OWADA, Yann-liang LI, Kazuaki MASUDA, Nobuyuki NISHIUCHI |
---|---|
Format: | Article |
Language: | English |
Published: |
International Institute of Informatics and Cybernetics
2005-02-01
|
Series: | Journal of Systemics, Cybernetics and Informatics |
Subjects: | |
Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/P686773.pdf
|
Similar Items
-
Proposed a branch and bound algorithm for Assembly flow shop scheduling problem
by: seyed mohammad hassan hosseini, et al.
Published: (2017-12-01) -
A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints
by: Mohamed Labidi, et al.
Published: (2018-01-01) -
Exact and Heuristic Procedures for the Two-Center Hybrid Flow Shop Scheduling Problem With Transportation Times
by: Lotfi Hidri, et al.
Published: (2018-01-01) -
Penjadwalan Produksi Untuk Meminimalkan Waktu Produksi Dengan Menggunakan Metode Branch And Bound
by: Nunung Indra Lesmana
Published: (2017-05-01) -
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
by: Christos Gogos
Published: (2023-11-01)