Pages that link to "Item:Q3200872"

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

Displaying 50 items.

• Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines (Q2286436) (← links)
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints (Q2294600) (← links)
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
• Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
• A metric for total tardiness minimization (Q2362385) (← links)
• Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
• The learning effect: getting to the core of the problem (Q2379968) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Parallel machine selection and job scheduling to minimize machine cost and job tardiness (Q2387248) (← links)
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines (Q2398650) (← links)
• Algorithms for single machine total tardiness scheduling with sequence dependent setups (Q2433437) (← links)
• Single machine scheduling with controllable release and processing parameters (Q2433805) (← links)
• Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667) (← links)
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
• Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
• A state-of-the-art review on scheduling with learning effects (Q2470096) (← links)
• Multi-agent scheduling on a single machine with max-form criteria (Q2470117) (← links)
• Scheduling aircraft landings using airlines' preferences (Q2482838) (← links)
• A bicriteria scheduling with sequence-dependent setup times (Q2506355) (← links)
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) (← links)
• A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times (Q2519079) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
• Complexity of two dual criteria scheduling problems (Q2643797) (← links)
• Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
• On minimizing total tardiness in a serial batching problem (Q2765603) (← links)
• A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM (Q2790358) (← links)
• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons (Q2875603) (← links)
• SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION (Q3069759) (← links)
• (Q3197606) (← links)
• SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM (Q3442757) (← links)
• Minimizing Total Tardiness on a Single Machine with Precedence Constraints (Q4025912) (← links)
• A genetic algorithm methodology for complex scheduling problems (Q4239710) (← links)
• Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem (Q5111888) (← links)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates (Q5323068) (← links)
• Single machine group scheduling with family setups to minimize total tardiness (Q5385473) (← links)
• Sequencing jobs on a single machine: A neural network approach (Q5928440) (← links)
• A memetic algorithm for the total tardiness single machine scheduling problem (Q5938406) (← links)
• Single machine scheduling with release times, deadlines and tardiness objectives (Q5946156) (← links)
• Fabrication scheduling on a single machine with due date constraints (Q5955094) (← links)
• Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)
• Optimization of departure runway scheduling incorporating arrival crossings (Q6070110) (← links)
• A Bicriteria Scheduling Problem with a Learning Effect: Total Completion Time and Total Tardiness (Q6102812) (← links)
• Manufacturing rescheduling after crisis or disaster-caused supply chain disruption (Q6106575) (← links)