Pages that link to "Item:Q3988910"

The following pages link to Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date (Q3988910):

Displaying 50 items.

• Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
• A single machine scheduling problem to minimize total early work (Q342425) (← links)
• An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
• Minimizing weighted mean absolute deviation of job completion times from their weighted mean (Q548013) (← 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)
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint (Q850651) (← 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)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date (Q883302) (← links)
• Due-window assignment problems with unit-time jobs (Q902534) (← links)
• CON due-date determination and sequencing (Q908841) (← links)
• Group sequencing around a common due date (Q937402) (← links)
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
• A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
• Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295) (← links)
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines (Q1040984) (← links)
• Non-approximability of just-in-time scheduling (Q1041346) (← links)
• Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← 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)
• Common due date scheduling problem with separate earliness and tardiness penalties (Q1207207) (← 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 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)
• Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method (Q1291768) (← 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 to minimize the weighted number of early and tardy agreeable jobs (Q1342333) (← links)
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date (Q1348560) (← links)
• Optimal common due-date with completion time tolerance (Q1360136) (← links)
• Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties (Q1368414) (← links)
• Using tabu search to solve the common due date early/tardy machine scheduling problem (Q1373879) (← links)
• Job selection in a heavily loaded shop (Q1373892) (← 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)
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145) (← links)
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111) (← links)