Abstract.
Equal-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques. Single-machine, parallel-machine, parallel-batch, open-shop, flow-shop and job-shop environments are touched upon.
Access this article
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: February 2003, Revised: September 2003,
AMS classification:
90B35, 68Q25
All correspondence to: Vadim G. Timkovsky
Rights and permissions
About this article
Cite this article
Baptiste, P., Brucker, P., Knust, S. et al. Ten notes on equal-processing-time scheduling. 4OR 2, 111–127 (2004). https://doi.org/10.1007/s10288-003-0024-4
Issue Date:
DOI: https://doi.org/10.1007/s10288-003-0024-4