Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine
V.A. Trapeznikov Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya st. 65, 117997 Moscow, Russia
Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, 39016 Magdeburg, Germany
Author to whom correspondence should be addressed.
Received: 23 January 2019 / Revised: 28 February 2019 / Accepted: 19 March 2019 / Published: 25 March 2019
PDF [299 KB, uploaded 25 March 2019]
In this paper, we consider a two-machine job-shop scheduling problem of minimizing total completion time subject to n
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 constant travel times between any two adjacent stations. We present a polynomial dynamic programming algorithm of the complexity
and a heuristic procedure of the complexity
. This settles the complexity status of the problem under consideration which was open before and extends earlier work for the two-station single-track railway scheduling problem. We also present computational results of the comparison of both algorithms. For the 30,000 instances with up to 30 jobs considered, the average relative error of the heuristic is less than
. In our tests, the practical running time of the dynamic programming algorithm was even bounded by
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Gafarov, E.; Werner, F. Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine. Mathematics 2019, 7, 301.
Gafarov E, Werner F. Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine. Mathematics. 2019; 7(3):301.
Gafarov, Evgeny; Werner, Frank. 2019. "Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine." Mathematics 7, no. 3: 301.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.