Pages that link to "Item:Q1600002"

The following pages link to On scheduling cycle shops: Classification, complexity and approximation (Q1600002):

Displaying 11 items.

• Converging to periodic schedules for cyclic scheduling problems with resources and deadlines (Q337140) (← links)
• Complexity results for weighted timed event graphs (Q429654) (← links)
• A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
• Throughput-optimal sequences for cyclically operated plants (Q732253) (← links)
• Scheduling in reentrant robotic cells: algorithms and complexity (Q880491) (← links)
• Semi-transitive orientations and word-representable graphs (Q908303) (← links)
• High-multiplicity cyclic job shop scheduling (Q957353) (← links)
• Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347) (← links)
• Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775) (← links)
• Alternation Graphs (Q3104776) (← links)
• Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints (Q5090138) (← links)