Pages that link to "Item:Q3829339"

The following pages link to Single-machine scheduling to minimize absolute deviation of completion times from a common due date (Q3829339):

Displaying 38 items.

• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
• Scheduling around a small common due date (Q1183621) (← links)
• Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
• A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date (Q1195100) (← links)
• On the general solution for a class of early/tardy problems (Q1207204) (← 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)
• Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine (Q1290164) (← links)
• Genetic search with dynamic operating disciplines (Q1342112) (← links)
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties (Q1765543) (← 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)
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time (Q1885972) (← 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)
• 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)
• Job sequencing and due date assignment in a single machine shop with uncertain processing times (Q2383106) (← links)
• Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times (Q2462556) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling (Q3335507) (← links)
• Minimizing the average deviation of job completion times about a common due date (Q3340483) (← links)
• Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment (Q3430238) (← links)
• Minimization of total absolute deviation for a common due date (Q3534456) (← links)
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date (Q3806975) (← links)
• Error Bound of a Heuristic for the Common Due Date Scheduling Problem (Q4282273) (← links)
• New Lower and Upper Bounds for Scheduling Around a Small Common Due Date (Q4287604) (← links)
• Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times (Q4314863) (← links)
• GENETIC ALGORITHMS FOR SINGLE MACHINE JOB SCHEDULING WITH COMMON DUE DATE AND SYMMETRIC PENALTIES (Q4320146) (← links)
• Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines (Q5289354) (← links)
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date (Q5939594) (← links)
• Single machine weighted earliness-tardiness penalty problem with a common due date (Q5939971) (← links)
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (Q5953167) (← links)