Pages that link to "Item:Q1302575"

The following pages link to Early/tardy scheduling with sequence dependent setups on uniform parallel machines (Q1302575):

Displaying 24 items.

• Dynamic routing strategies for JIT production in hybrid flow shops (Q339696) (← links)
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (Q833543) (← links)
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties (Q940876) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times (Q1628056) (← links)
• Scheduling job classes on uniform machines (Q1761112) (← links)
• A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
• Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time (Q1885972) (← links)
• Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
• An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
• Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization (Q2958668) (← links)
• Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem (Q5086007) (← links)
• Hierarchical production planning and scheduling in a multi-product, batch process environment (Q5444475) (← links)
• Dispatching problems for parallel machines in the TFT‐LCD assembly process (Q6092611) (← links)
• Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling (Q6613982) (← links)