Pages that link to "Item:Q4103320"

The following pages link to Minimizing maximum lateness on one machine: computational experience and some applications (Q4103320):

Displaying 41 items.

• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
• Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
• Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
• About one algorithm for solving scheduling problem (Q748247) (← links)
• New directions in scheduling theory (Q786649) (← links)
• New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
• A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
• Probabilistic single processor scheduling (Q912611) (← links)
• Single facility multi-class job scheduling (Q917435) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• A block approach for single-machine scheduling with release dates and due dates (Q1083026) (← links)
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
• An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165) (← links)
• A procedure for the one-machine sequencing problem with dependent jobs (Q1130073) (← links)
• Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (Q1147628) (← links)
• Applying new dominance concepts to job schedule optimization (Q1162922) (← links)
• The one-machine sequencing problem (Q1162927) (← links)
• An algorithm for single machine sequencing with release dates to minimize total weighted completion time (Q1171502) (← links)
• Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
• Simple algorithms for multiprocessor scheduling to meet deadlines (Q1248336) (← links)
• Deadline scheduling of tasks with ready times and resource constraints (Q1255432) (← links)
• Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
• A note on generalizing the maximum lateness criterion for scheduling (Q1315993) (← links)
• Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
• Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
• Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution (Q1754012) (← links)
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• A sequencing problem with family setup times (Q1917311) (← links)
• Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
• A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
• Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
• (Q2861543) (← links)
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)
• An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
• A heuristic approach for single-machine scheduling with due dates and class setups. (Q5945318) (← links)
• A historical note on the complexity of scheduling problems (Q6161270) (← links)