EA/G-GA for single machine scheduling problems with earliness/tardiness costs
From MaRDI portal
(Redirected from Publication:400876)
Recommendations
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties
- The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs
- The stochastic single machine scheduling problem with earliness and tardiness costs
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
Cites work
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3270307 (Why is no real title available?)
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- A survey of optimization by building and using probabilistic models
- A utility-based approach to some information measures
- An electromagnetism-like mechanism for global optimization
- An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- Improved heuristics for the early/tardy scheduling problem with no idle time
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Single machine earliness and tardiness scheduling
- The Single Machine Early/Tardy Problem
- The one-machine problem with earliness and tardiness penalties
Cited in
(3)
This page was built for publication: EA/G-GA for single machine scheduling problems with earliness/tardiness costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400876)