Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
From MaRDI portal
Publication:1290645
Recommendations
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- scientific article; zbMATH DE number 3848953
- Publication:3481474
- Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
- Single machine group scheduling with resource dependent setup and processing times
Cited in
(10)- Sequencing situations with just-in-time arrival, and related games
- The traveling salesman problem with job-times (\textit{TSPJ})
- Scheduling multi-colour print jobs with sequence-dependent setup times
- ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- A 3/2-Approximation for the Metric Many-Visits Path TSP
- A survey of scheduling problems with setup times or costs
- New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
This page was built for publication: Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290645)
