A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
From MaRDI portal
Publication:1906942
DOI10.1016/0305-0548(94)00073-HzbMath0838.90066MaRDI QIDQ1906942
Publication date: 28 January 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items
Preemption in single machine earliness/tardiness scheduling, Machine scheduling with earliness, tardiness and non-execution penalties, Using genetic algorithm for dynamic and multiple criteria web-site optimizations, Minmax scheduling with job-classes and earliness-tardiness costs, Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory, Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete, Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties, Metaheuristics: A bibliography, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions., Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness, Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard, 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, Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms, Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows, Single machine scheduling with symmetric earliness and tardiness penalties, Minimizing earliness and tardiness costs in stochastic scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- A Dynamic Programming Approach to Sequencing Problems
- Sequencing with Earliness and Tardiness Penalties: A Review
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- The Single Machine Early/Tardy Problem
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties