Pages that link to "Item:Q4695783"

The following pages link to Single-machine scheduling with early and tardy completion costs (Q4695783):

Displaying 50 items.

• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• A comparison of lower bounds for the single-machine early/tardy problem (Q868992) (← links)
• An improved earliness--tardiness timing algorithm (Q878565) (← links)
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
• Efficient algorithms for machine scheduling problems with earliness and tardiness penalties (Q940876) (← links)
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← 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)
• Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) (← 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 neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem (Q1290704) (← links)
• The stochastic single machine scheduling problem with earliness and tardiness costs (Q1333461) (← links)
• Robustness of single machine scheduling problems to earliness and tardiness penalty errors (Q1383131) (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
• A heuristic for single machine scheduling with early and tardy costs (Q1592742) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling (Q1603328) (← links)
• Performance enhancements to tabu search for the early/tardy scheduling problem (Q1609889) (← links)
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145) (← links)
• Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
• An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions (Q1772863) (← links)
• Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
• Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363) (← links)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• Single machine scheduling to minimize the number of early and tardy jobs (Q1919786) (← links)
• New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555) (← links)
• A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• Single machine scheduling with family setups to minimize total earliness and tardiness (Q2467252) (← links)
• A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
• Earliness and tardiness single machine scheduling with proportional weights (Q2564875) (← links)
• Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
• Just-in-time single-batch-processing machine scheduling (Q2669787) (← links)
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem (Q2958666) (← links)
• BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS (Q3397512) (← links)
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date (Q3988911) (← links)
• An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs (Q4883157) (← links)
• Algoritmo de programação de máquinas individuais com penalidades distintas de adiantamento e atraso (Q5189091) (← 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)
• Parallel machine scheduling with a common due window (Q5953340) (← links)