Exact and Heuristic Procedures for the Two-Center Hybrid Flow Shop Scheduling Problem With Transportation Times
This paper addresses the two centers hybrid flow shop scheduling problem with transportation times. This problem is faced in several real-world applications. The considered objective function to be minimized in this problem is the maximum completion time. This scheduling problem is NP-hard, and most...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8336873/ |