Pages that link to "Item:Q3335507"

The following pages link to Minimizing the sum of absolute lateness in single-machine and multimachine scheduling (Q3335507):

Displaying 48 items.

• A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden (Q579120) (← links)
• Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
• Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
• Dynamic programming approach to the single-machine sequencing problem with different due-dates (Q913669) (← links)
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
• An alternative proof of optimality for the common due-date assignment problem (Q1107429) (← links)
• Survey of scheduling research involving due date determination decisions (Q1111925) (← links)
• Equivalence of mean flow time problems and mean absolute deviation problems (Q1173904) (← links)
• Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
• On the general solution for a class of early/tardy problems (Q1207204) (← links)
• Common due date scheduling problem with separate earliness and tardiness penalties (Q1207207) (← links)
• Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date (Q1278532) (← links)
• Scheduling under a common due-date on parallel unrelated machines (Q1291766) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
• The complexity of scheduling job families about a common due date (Q1376265) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
• Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
• Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
• Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851) (← links)
• Single machine earliness-tardiness scheduling with resource-dependent release dates (Q1847239) (← links)
• Parallel machine earliness and tardiness scheduling with proportional weights (Q1870834) (← links)
• Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← 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 branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• Algorithms for a class of single-machine weighted tardiness and earliness problems (Q2277355) (← links)
• An exact algorithm to minimize mean squared deviation of job completion times about a common due date (Q2356179) (← links)
• Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties (Q2483517) (← links)
• A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
• Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• Determination of an optimal common due date and optimal sequence in a single machine job shop (Q3787779) (← links)
• Optimal scheduling of jobs about a common due date on a single machine (Q3986089) (← links)
• Multiple common due dates (Q4434513) (← links)
• A dual criteria sequencing problem with earliness and tardiness penalties (Q4552543) (← links)
• Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
• Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date (Q5937351) (← links)
• Minmax earliness-tardiness costs with unit processing time jobs (Q5937720) (← links)
• Single machine weighted earliness-tardiness penalty problem with a common due date (Q5939971) (← links)