Pages that link to "Item:Q1299919"
From MaRDI portal
The following pages link to Preemptive job-shop scheduling problems with a fixed number of jobs (Q1299919):
Displaying 15 items.
- An optimal method for the preemptive job shop scheduling problem (Q502444) (← links)
- 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)
- A practical use of Jackson's preemptive schedule for solving the job shop problem (Q922282) (← links)
- Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints (Q1096532) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
- The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← 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)
- Tighter bounds on preemptive job shop scheduling with two machines (Q5947304) (← links)
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)