Pages that link to "Item:Q1962026"

The following pages link to On the complexity of minimizing the number of late jobs in unit time open shop (Q1962026):

Displaying 9 items.

• Scheduling jobs with equal processing times and time windows on identical parallel machines (Q835604) (← links)
• The complexity of mean flow time scheduling problems with release times (Q880590) (← 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)
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Parallel machine problems with equal processing times: a survey (Q2434248) (← links)