Pages that link to "Item:Q4055376"

The following pages link to On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness (Q4055376):

Displaying 35 items.

• Developing feasible and optimal schedules of jobs on one machine (Q380659) (← links)
• Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
• Fuzzy job-shop scheduling problems: a review (Q506738) (← links)
• New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
• Scheduling of project networks (Q908839) (← links)
• A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates (Q976008) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• Average and worst-case analysis of heuristics for the maximum tardiness problem (Q1080771) (← 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)
• Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
• On optimal lateness and tardiness scheduling in real-time systems (Q1184690) (← links)
• One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849) (← links)
• Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Flowshop scheduling with identical jobs and uniform parallel machines (Q1303728) (← links)
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
• A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
• Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
• Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
• Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
• Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
• A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
• Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
• Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← 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)
• An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)