Single-machine scheduling with early and tardy completion costs
From MaRDI portal
Publication:4695783
DOI<85::AID-NAV3220400106>3.0.CO;2-C 10.1002/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-CzbMath0769.90048OpenAlexW2006188511MaRDI QIDQ4695783
Publication date: 29 June 1993
Full work available at URL: https://doi.org/10.1002/1520-6750(199302)40:1<85::aid-nav3220400106>3.0.co;2-c
Related Items
The stochastic single machine scheduling problem with earliness and tardiness costs, Preemption in single machine earliness/tardiness scheduling, Machine scheduling with earliness, tardiness and non-execution penalties, Optimal restricted due date assignment in scheduling, Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, Improving schedule stability in single-machine rescheduling for new operation insertion, A comparison of lower bounds for the single-machine early/tardy problem, A multi-objective optimization for preemptive identical parallel machines scheduling problem, An improved earliness--tardiness timing algorithm, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, Just-in-time single-batch-processing machine scheduling, An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem, A composite heuristic for the single machine early/tardy job scheduling problem., New heuristics for total tardiness minimization in a flexible flowshop, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence, A branch and bound approach for single machine scheduling with earliness and tardiness penalties, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Efficient algorithms for machine scheduling problems with earliness and tardiness penalties, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, Single machine scheduling with family setups to minimize total earliness and tardiness, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed, A recovering beam search algorithm for the single machine just-in-time scheduling problem, Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem, An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions, Optimal timing of a sequence of tasks with general completion costs, Earliness-tardiness scheduling with setup considerations, Algoritmo de programação de máquinas individuais com penalidades distintas de adiantamento e atraso, Parallel machine scheduling with a common due window, The one-machine just-in-time scheduling problem with preemption, A new model for the preemptive earliness-tardiness scheduling problem, BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, Scheduling with batch setup times and earliness-tardiness penalties, A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem, Earliness and tardiness single machine scheduling with proportional weights, Punctuality and idleness in just-in-time scheduling, Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, A heuristic for single machine scheduling with early and tardy costs, A survey of the state-of-the-art of common due date assignment and scheduling research, Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling, Performance enhancements to tabu search for the early/tardy scheduling problem, A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
