Pages that link to "Item:Q3988911"

The following pages link to Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date (Q3988911):

Displaying 50 items.

• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Total absolute deviation of job completion times on uniform and unrelated machines (Q609815) (← links)
• On scheduling around large restrictive common due windows (Q704121) (← links)
• Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
• 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)
• An improved earliness--tardiness timing algorithm (Q878565) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• Group sequencing around a common due date (Q937402) (← links)
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties (Q943438) (← links)
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
• Non-approximability of just-in-time scheduling (Q1041346) (← links)
• A fixed interval due-date scheduling problem with earliness and due-date costs (Q1127177) (← links)
• Scheduling around a small common due date (Q1183621) (← 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)
• Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs (Q1268191) (← links)
• \(V\)-shape property for job sequences that minimize the expected completion time variance (Q1278193) (← links)
• A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← 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 about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date (Q1310010) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Due window scheduling for parallel machines (Q1341402) (← links)
• Earliness-tardiness scheduling problems with a common delivery window (Q1342083) (← links)
• Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
• Using tabu search to solve the common due date early/tardy machine scheduling problem (Q1373879) (← links)
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness (Q1373894) (← links)
• The complexity of scheduling job families about a common due date (Q1376265) (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Single machine scheduling with assignable due dates (Q1613425) (← links)
• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• Minimizing total completion time and total deviation of job completion times from a restrictive due-date (Q1776951) (← links)
• On the complexity of the single machine scheduling problem minimizing total weighted delay penalty (Q1785249) (← 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 earliness-tardiness scheduling with resource-dependent release dates (Q1847239) (← links)
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan (Q1877048) (← links)
• Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← 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 earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs (Q1892102) (← links)
• An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date (Q1905077) (← links)
• The weighted common due date single machine scheduling problem revisited (Q1919202) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)