An Artificial Bee Colony Based Hyper-heuristic for the Single Machine Order Acceptance and Scheduling Problem
From MaRDI portal
Publication:4613886
DOI10.1007/978-981-13-0860-4_5zbMath1405.90060OpenAlexW2892176789MaRDI QIDQ4613886
Joong Hoon Kim, Sachchida Nand Chaurasia
Publication date: 25 January 2019
Published in: Decision Science in Action (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-13-0860-4_5
optimizationsingle machineevolutionary algorithmguided mutationhyper-heuristicartificial bee colonysequence-dependent setup timeorder acceptance and scheduling
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Order acceptance with weighted tardiness
- Order acceptance using genetic algorithms
- Job selection in a heavily loaded shop
- Dynamic order acceptance and capacity planning on a single bottleneck resource
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology