Pages that link to "Item:Q3200872"

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

Displaying 50 items.

• A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114) (← links)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
• Single-machine scheduling under the job rejection constraint (Q964407) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• A parallel multiple reference point approach for multi-objective optimization (Q976459) (← links)
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
• A decomposition scheme for single stage scheduling problems (Q983632) (← links)
• Order acceptance using genetic algorithms (Q1000954) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times (Q1000975) (← links)
• Heuristic factory planning algorithm for advanced planning and scheduling (Q1010253) (← links)
• Scheduling jobs with agreeable processing times and due dates on a single batch processing machine (Q1022597) (← links)
• Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
• Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
• On the complexity of generalized due date scheduling problems (Q1175769) (← links)
• On minimizing the sum of \(k\) tardinesses (Q1178234) (← links)
• Single machine scheduling problem with a common deadline and resource dependent release dates (Q1178528) (← links)
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
• A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem (Q1265840) (← links)
• Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine (Q1266653) (← links)
• A neural network model for scheduling problems (Q1268160) (← links)
• A simulated annealing approach for the one-machine mean tardiness scheduling problem (Q1268192) (← links)
• Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)
• An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling (Q1278192) (← links)
• A note on the equivalence of two heuristics to minimize total tardiness (Q1278526) (← links)
• Evaluation of leading heuristics for the single machine tardiness problem (Q1278530) (← links)
• Complexity of single machine, multi-criteria scheduling problems (Q1309989) (← links)
• A heuristic for the single machine tardiness problem (Q1310015) (← links)
• A greedy heuristic for the mean tardiness sequencing problem (Q1317079) (← links)
• On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
• Scheduling in a sequence dependent setup environment with genetic search (Q1342322) (← links)
• Decomposition of the single machine total tardiness problem (Q1362989) (← links)
• Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
• General stochastic single-machine scheduling with regular cost functions (Q1381780) (← links)
• Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
• A note on the SPT heuristic for solving scheduling problems with generalized due dates (Q1433162) (← links)
• Parallel machine scheduling with a common server (Q1566574) (← links)
• Solution of the single machine total tardiness problem (Q1592283) (← links)
• Dynamic scheduling of stochastic jobs on a single machine (Q1600933) (← links)
• Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
• Minimizing the expected number of tardy jobs when processing times are normally distributed (Q1612011) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server (Q1634053) (← links)
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
• General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)