Pages that link to "Item:Q3824090"

The following pages link to One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties (Q3824090):

Displaying 50 items.

• An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions (Q1772863) (← links)
• Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
• Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
• A functional equation that arises in problems of scheduling with priorities and lateness/earliness penalties (Q1804954) (← links)
• Single machine earliness-tardiness scheduling with resource-dependent release dates (Q1847239) (← links)
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363) (← links)
• PERT scheduling with convex cost functions. (Q1853737) (← links)
• Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems'' (Q1890955) (← 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)
• Earliness and tardiness scheduling problems on a batch processor (Q1961238) (← links)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• Single-machine scheduling with an external resource (Q2030286) (← links)
• On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
• Single machine rescheduling for new orders with maximum lateness minimization (Q2147102) (← links)
• Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
• Algorithms for a class of single-machine weighted tardiness and earliness problems (Q2277355) (← links)
• Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
• The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• A note on one-processor scheduling with asymmetric earliness and tardiness penalties (Q2367041) (← links)
• Minimizing variation of production rates in just-in-time systems: A survey (Q2367376) (← links)
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Parallel-machine scheduling under potential disruption (Q2465564) (← links)
• Single machine scheduling with family setups to minimize total earliness and tardiness (Q2467252) (← links)
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime (Q2482817) (← links)
• A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
• Minimizing the earliness--tardiness costs on a single machine (Q2499156) (← links)
• A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
• Earliness and tardiness single machine scheduling with proportional weights (Q2564875) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
• Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
• Complexity of two dual criteria scheduling problems (Q2643797) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• Minimizing the earliness and tardiness cost of a sequence of tasks on a single machine. (Q2773167) (← links)
• On inverse chromatic number problems (extended abstract) (Q2861543) (← links)
• Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
• Just-in-Time Scheduling in Modern Mass Production Environment (Q2958673) (← links)
• Multicriteria models for just-in-time scheduling (Q2997893) (← links)
• A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time (Q3055211) (← links)