Pages that link to "Item:Q3200872"

The following pages link to Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872):

Displaying 50 items.

• Multitasking via alternate and shared processing: algorithms and complexity (Q284835) (← links)
• The complexity of scheduling starting time dependent tasks with release times (Q293188) (← links)
• Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136) (← links)
• A note on scheduling problems with competing agents and earliness minimization objectives (Q319703) (← links)
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints (Q320637) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• A survey on single crane scheduling in automated storage/retrieval systems (Q323403) (← links)
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
• On optimizing a bi-objective flowshop scheduling problem in an uncertain environment (Q356401) (← links)
• A note on reverse scheduling with maximum lateness objective (Q398863) (← links)
• Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm (Q400054) (← links)
• Improving the anytime behavior of two-phase local search (Q408982) (← links)
• Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
• A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
• Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (Q459536) (← links)
• Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
• Algorithms for some maximization scheduling problems on a single machine (Q612210) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming (Q633553) (← links)
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
• Single machine scheduling with total tardiness criterion and convex controllable processing times (Q646664) (← links)
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (Q670296) (← links)
• Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
• Complexity results for flow shop problems with synchronous movement (Q726218) (← links)
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem (Q732689) (← links)
• A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
• Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
• The coordination of scheduling and batch deliveries (Q816348) (← links)
• Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
• Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
• A bicriteria parallel machine scheduling with a learning effect of setup and removal times (Q840149) (← links)
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
• A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
• Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
• An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness (Q864814) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
• Order acceptance with weighted tardiness (Q878579) (← links)
• Order scheduling in an environment with dedicated resources in parallel (Q880508) (← links)
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach (Q883312) (← links)
• Two-agent single machine scheduling with forbidden intervals (Q902407) (← links)
• Single-machine scheduling against due dates with past-sequence-dependent setup times (Q933538) (← links)
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
• A hybrid algorithm for the single-machine total tardiness problem (Q954025) (← links)