An Evaluation of Mathematical Programming and Lower-Bound Methods for Hybrid Flow Shop Problems With a Makespan Criterion
This paper considers the hybrid flow shop scheduling problem, where jobs are processed in <inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> stages with the same route of the stage. Each stage has identical parallel machines for processing...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10103894/ |