Pages that link to "Item:Q1848363"

The following pages link to Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363):

Displaying 28 items.

• Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs (Q337279) (← links)
• Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid (Q535971) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• An improved earliness--tardiness timing algorithm (Q878565) (← links)
• Scheduling with returnable containers (Q906554) (← links)
• The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
• Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
• Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs (Q2027084) (← links)
• An uncertain programming model for single machine scheduling problem with batch delivery (Q2313751) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs (Q2378377) (← links)
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
• A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
• A survey on scheduling problems with due windows (Q2630089) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study (Q3055316) (← links)
• Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows (Q5861097) (← links)
• Capacity allocation in a service system with preferred service completion times (Q6077481) (← links)
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders (Q6195034) (← links)