New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks
In this paper, we address the hybrid flow shop scheduling problem with multiprocessor tasks. The objective is to minimize the maximum completion time. This problem is encountered in manufacturing, parallel and distributed computing, and real-time machine vision systems. This problem is strongly NP-h...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2017-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/7907262/ |