Pages that link to "Item:Q1299919"

The following pages link to Preemptive job-shop scheduling problems with a fixed number of jobs (Q1299919):

Displaying 8 items.

• Scheduling equal processing time jobs to minimize the weighted number of late jobs (Q853793) (← links)
• Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
• Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
• Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← 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)
• Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)