A heuristic hybrid framework for vector job scheduling
From MaRDI portal
Publication:4987672
DOI10.2298/YJOR150416013AzbMATH Open1474.90135MaRDI QIDQ4987672FDOQ4987672
Authors: Nareyus I. Lawrance Amaldass, Nenad Mladenović, Cormac Lucas
Publication date: 3 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Recommendations
- A hybrid tabu search heuristic for the two-stage assembly scheduling problem
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- Two-Stage, Hybrid Flowshop Scheduling Problem
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Attraction probabilities in variable neighborhood search
- Variable neighborhood search
- An algorithm for the single machine sequencing problem with precedence constraints
- Handbook of metaheuristics
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- Title not available (Why is that?)
- The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
- A hybrid tabu search heuristic for the two-stage assembly scheduling problem
- Hybridization of ant colony optimization strategies in tabu search for solving job shop scheduling problems
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- Approximation Algorithms for the Assembly Line Crew Scheduling Problem
- Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
Cited In (1)
This page was built for publication: A heuristic hybrid framework for vector job scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987672)