Pages that link to "Item:Q3818793"

The following pages link to The Single Machine Early/Tardy Problem (Q3818793):

Displaying 50 items.

• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
• EA/G-GA for single machine scheduling problems with earliness/tardiness costs (Q400876) (← links)
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
• Extended beam search for non-exhaustive state space analysis (Q652163) (← links)
• Algorithm for minimizing weighted earliness penalty in single-machine problem (Q706977) (← links)
• A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties (Q838299) (← links)
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
• Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
• Order acceptance with weighted tardiness (Q878579) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date (Q1195100) (← links)
• Single-machine scheduling with time windows and earliness/tardiness penalties (Q1278201) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• Single machine earliness and tardiness scheduling (Q1278531) (← links)
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem (Q1290704) (← links)
• Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
• A heuristic for single machine scheduling with early and tardy costs (Q1592742) (← links)
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
• Performance enhancements to tabu search for the early/tardy scheduling problem (Q1609889) (← links)
• On the flexibility of a decision theory-based heuristic for single machine scheduling (Q1628046) (← links)
• Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• An exact approach to early/tardy scheduling with release dates (Q1781563) (← links)
• Insertion techniques for the heuristic solution of the job shop problem (Q1805458) (← links)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363) (← links)
• Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
• Improved heuristics for the early/tardy scheduling problem with no idle time (Q1886859) (← links)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights (Q1906942) (← links)
• Focused simulated annealing search: An application to job shop scheduling (Q1919835) (← links)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• Scheduling just-in-time part supply for mixed-model assembly lines (Q2275595) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics (Q2366078) (← links)
• Job sequencing and due date assignment in a single machine shop with uncertain processing times (Q2383106) (← links)
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
• Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties (Q2483517) (← links)
• A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)