Pages that link to "Item:Q1392555"

The following pages link to Is a unit-job shop not easier than identical parallel machines? (Q1392555):

Displaying 8 items.

• Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
• On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem (Q1962067) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391) (← links)