The following pages link to (Q4055377):
Displaying 21 items.
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- Stochastic scheduling to minimize expected maximum lateness (Q2482822) (← links)
- The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness (Q2563893) (← links)
- Fast neighborhood search for the single machine total weighted tardiness problem (Q2583706) (← links)
- Approximate Deadline-Scheduling with Precedence Constraints (Q3452812) (← links)
- (Q5009585) (← links)
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)
- Complexity of Project Scheduling Problem with Nonrenewable Resources (Q5391960) (← links)
- Scheduling with target start times (Q5925938) (← links)
- On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136) (← links)
- A flexible flowshop problem with total flow time minimization (Q5939584) (← links)
- Single machine scheduling with release times, deadlines and tardiness objectives (Q5946156) (← links)
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)
- Makespan minimization for flow-shop problems with transportation times and a single robot (Q5946823) (← links)
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates (Q5952071) (← links)
- Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)
- Algorithms for minclique scheduling problems (Q5961609) (← links)
- The non-stop disjoint trajectories problem (Q6564192) (← links)
