Scheduling no-wait production with time windows and flexible processing times.
This paper presents a low-complexity algorithm for online job scheduling at workcenters along a given route in a manufacturing system. At each workcenter, the job has to be processed by any one of a given set of identical machines. Each machine has a preset schedule of operations, leaving out time-w...
| Udgivet i: | IEEE Transactions on robotics and automation 17, 1 (2001). |
|---|---|
| Hovedforfatter: | |
| Format: | Article |
| Sprog: | English |
| Fag: |