Job-shop scheduling with blocking and no-wait constraints
By Alessandro Mascis, Dario Pacciarelli. European Journal of Operational Research, 2002
543 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/1c13d20a4f9bea46e92f4f95eeb9f5f480df90af
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Industrial and Manufacturing Engineering
Citations in the corpus
- Surgical case scheduling as a generalized job shop scheduling problem (2008, background): “uling with multiprocessors [4,35], flexible processors [10,31], flexible multiprocessors [5,11], or blocking [18,30].”
- A tabu search algorithm for rerouting trains during rail operations (2007, methodology): “Flamini and Pacciarelli [14] address the problem of routing trains through an underground rail terminus and develop a heuristic algorithm for a bicriteria version of the problem in which earliness/tardiness and train headways have to be optimized.”
- No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN) (2016, unknown): “ISBN 978-1-4503-4787-7/16/10. . . $15.00 DOI: http://dx.doi.org/10.1145/2997465.2997494”