Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
From MaRDI portal
Publication:976037
DOI10.1016/j.cor.2010.01.002zbMath1188.90106OpenAlexW2139996487MaRDI QIDQ976037
Jose M. Framinan, Paz Perez-Gonzalez
Publication date: 11 June 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/23449
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Variable neighbourhood structures for cycle location problems ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Variable neighborhood search
- Rescheduling on a single machine with part-type dependent setup times and deadlines
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- A comprehensive review and evaluation of permutation flowshop heuristics
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Benchmarks for basic scheduling problems
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
- Rescheduling for New Orders
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs
- Scheduling in flowshops to minimize total tardiness of jobs
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Variable neighborhood search: Principles and applications
This page was built for publication: Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
