Pages that link to "Item:Q1906942"
From MaRDI portal
The following pages link to A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights (Q1906942):
Displaying 20 items.
- Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
- Using genetic algorithm for dynamic and multiple criteria web-site optimizations (Q853060) (← links)
- Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
- Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory (Q857327) (← links)
- Genetic algorithms for supply-chain scheduling: a case study in the distribution of ready-mixed concrete (Q857351) (← links)
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic (Q878591) (← links)
- Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates (Q1044134) (← links)
- RTSS: An interactive decision support system for solving real time scheduling problems considering customer and job priorities with schedule interruptions. (Q1406711) (← links)
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties (Q1652242) (← links)
- Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363) (← links)
- Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
- Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
- Minimizing earliness and tardiness costs in stochastic scheduling (Q2356252) (← links)
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
- Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667) (← 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)
- Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows (Q5861097) (← links)