Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine
In this paper, we consider a two-machine job-shop scheduling problem of minimizing total completion time subject to <i>n</i> jobs with two operations and equal processing times on each machine. This problem occurs e.g., as a single-track railway scheduling problem with three stations and...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-03-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/3/301 |