EA/G-GA for single machine scheduling problems with earliness/tardiness costs

DOI10.3390/E13061152zbMATH Open1305.90211OpenAlexW2132124153MaRDI QIDQ400876FDOQ400876

Authors: Shih-Hsin Chen, Min-Chih Chen, Pei-Chann Chang, Yuh-Min Chen 

Publication date: 26 August 2014

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e13061152

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

zbMATH Keywords

probability estimationestimation of distribution algorithmsdiversityEA/Gsingle machine scheduling problemsstatistical learning problem

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Cites Work

• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
• Title not available (Why is that?)
• Scheduling with release dates on a single machine to minimize total weighted completion time
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• An electromagnetism-like mechanism for global optimization
• Title not available (Why is that?)
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Single machine earliness and tardiness scheduling
• The one-machine problem with earliness and tardiness penalties
• An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
• The Single Machine Early/Tardy Problem
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• A survey of optimization by building and using probabilistic models
• Improved heuristics for the early/tardy scheduling problem with no idle time
• Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
• A utility-based approach to some information measures
• Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem

Cited In (3)

• An artificial bee colony algorithm for the job shop scheduling problem with random processing times
• Interaction enhanced imperialist competitive algorithms
• Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates

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)