Pages that link to "Item:Q4162942"

The following pages link to Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties (Q4162942):

Displaying 36 items.

• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (Q579120) (← links)
• Minimization of the maximum deviation with preemption (Q761957) (← links)
• Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
• Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
• Earliness tardiness production planning and scheduling in flexible flowshop systems under finite planning horizon (Q879577) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• Ordering the structural set of jobs, minimizing the total penalty (Q1165775) (← 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)
• Due window scheduling for parallel machines (Q1341402) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Maximizing the weighted number of on-time jobs in single machine scheduling with time windows (Q1368435) (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
• Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
• Scheduling job classes on uniform machines (Q1761112) (← links)
• A note on a due-date assignment on a two-machine flow-shop (Q1765554) (← links)
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs (Q1807950) (← links)
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851) (← links)
• Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
• Algorithms for a class of single-machine weighted tardiness and earliness problems (Q2277355) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• Single machine scheduling problem with multiple due windows assignment in a group technology (Q2346511) (← links)
• Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
• Earliness--tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming (Q2432869) (← links)
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667) (← links)
• A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
• A survey on scheduling problems with due windows (Q2630089) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
• Single machine scheduling with release dates: a distributionally robust approach (Q6112405) (← links)
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders (Q6195034) (← links)