Pages that link to "Item:Q1290645"

The following pages link to Sequencing jobs that require common resources on a single machine: A solvable case of the TSP (Q1290645):

Displaying 10 items.

• Sequencing situations with just-in-time arrival, and related games (Q486940) (← links)
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
• \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem (Q2026989) (← links)
• New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources (Q2106718) (← links)
• \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156) (← links)
• Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017) (← links)
• Scheduling multi-colour print jobs with sequence-dependent setup times (Q2341398) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• The traveling salesman problem with job-times (\textit{TSPJ}) (Q2668643) (← links)
• A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)