Minimal cycle time determination and golf neighborhood generation for the cyclic flexible job shop problem
Main Authors: | M. Wodecki, W. Bożejko, J. Pempera |
---|---|
Format: | Article |
Language: | English |
Published: |
Polish Academy of Sciences
2018-06-01
|
Series: | Bulletin of the Polish Academy of Sciences: Technical Sciences |
Subjects: | |
Online Access: | https://journals.pan.pl/Content/107665/PDF/10.24425123440.pdf |
Similar Items
-
Blocking Cyclic Job-Shop Scheduling Problems
by: Atabak Elmi, et al.
Published: (2022-10-01) -
Modeling and Solution of Job Shop Scheduling with No-Wait Orders to Minimize Makespan: A Decomposition Approach based on Order Sequencing and Timetabling
by: Hadi Mokhtari
Published: (2017-09-01) -
Investigation of Flexible Job Shop with Machine Availability Constraints
by: Nurul Izah Anuar, et al.
Published: (2024-03-01) -
Learning the Quality of Machine Permutations in Job Shop Scheduling
by: Andrea Corsini, et al.
Published: (2022-01-01) -
<b>A genetic algorithm and variable neighborhood search for the unrelated parallel machine scheduling problem with sequence dependent setup time
by: Everton Tozzo, et al.
Published: (2018-09-01)