Pages that link to "Item:Q1838424"

The following pages link to A decomposition algorithm for the single machine total tardiness problem (Q1838424):

Displaying 49 items.

• Scheduling identical jobs on uniform parallel machines under position-based learning effects (Q1637750) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← links)
• Optimal and heuristic solutions for a scheduling problem arising in a foundry (Q1772868) (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363) (← links)
• Improving the performance of enumerative search methods. I: Exploiting structure and intelligence (Q1892667) (← links)
• On decomposition of the total tardiness problem (Q1924615) (← links)
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
• A special case of the single-machine total tardiness problem is NP-hard (Q1946412) (← links)
• New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance (Q2147013) (← links)
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
• The proportionate flow shop total tardiness problem (Q2178064) (← links)
• Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
• Single machine scheduling with nonlinear cost functions (Q2277133) (← links)
• Algorithms for a class of single-machine weighted tardiness and earliness problems (Q2277355) (← links)
• Coupled task scheduling with exact delays: literature review and models (Q2282490) (← links)
• Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty (Q2286919) (← links)
• Minimizing total tardiness on a single machine with unequal release dates (Q2462144) (← links)
• Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
• A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
• Genetic local search for multi-objective flowshop scheduling problems (Q2566706) (← links)
• Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons (Q2875603) (← links)
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness (Q2958669) (← links)
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
• The application of genetic algorithms to lot streaming in a job-shop scheduling problem (Q3055438) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
• A bicriterion scheduling problem involving total flowtime and total tardiness (Q4264495) (← links)
• Two-machine flowshop scheduling to minimize total tardiness (Q4352599) (← links)
• A due date-based approach to part type selection in flexible manufacturing systems (Q4394252) (← links)
• Simulation Optimization for MRO Systems Operations (Q4978462) (← 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)
• Algorithmic paradoxes of the single-machine total tardiness problem (Q5937433) (← links)
• Single machine scheduling with release times, deadlines and tardiness objectives (Q5946156) (← links)
• Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
• INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment (Q6535663) (← links)