Pages that link to "Item:Q1326784"

The following pages link to A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784):

Displayed 8 items.

• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) ‎ (← links)
• On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) ‎ (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) ‎ (← links)
• Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) ‎ (← links)
• Complexity of mixed shop scheduling problems: A survey (Q1969835) ‎ (← links)
• Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) ‎ (← links)
• An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents (Q6087487) ‎ (← links)
• Two-machine job-shop scheduling with one joint job (Q6153460) ‎ (← links)