Pages that link to "Item:Q878565"

The following pages link to An improved earliness--tardiness timing algorithm (Q878565):

Displaying 16 items.

• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
• The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
• A new model for the preemptive earliness-tardiness scheduling problem (Q1013402) (← links)
• Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
• An exact algorithm for the bi-objective timing problem (Q1653286) (← 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)
• A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
• Learning variable neighborhood search for a scheduling problem with time windows and rejections (Q2414479) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• Multicriteria models for just-in-time scheduling (Q2997893) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5893964) (← links)
• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)