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
-
A fine-grained parallel algorithm for the cyclic flexible job shop problem
by: Bożejko Wojciech, et al.
Published: (2017-06-01) -
Parallel patterns determination in solving cyclic flow shop problem with setups
by: Bożejko Wojciech, et al.
Published: (2017-06-01) -
Cyclic flow shop scheduling problem with two-machine cells
by: Bożejko Wojciech, et al.
Published: (2017-06-01) -
A memetic algorithm for minimizing the makespan in the Job Shop Scheduling problem
by: Henry Lamos-Díaz, et al.
Published: (2017-01-01) -
Blocking Cyclic Job-Shop Scheduling Problems
by: Atabak Elmi, et al.
Published: (2022-10-01)