Setting a common due date in a constrained flowshop: a variable neighbourhood search approach

DOI10.1016/J.COR.2010.01.002zbMATH Open1188.90106OpenAlexW2139996487MaRDI QIDQ976037FDOQ976037

Authors: Paz Perez-Gonzalez, Jose M. Framinan 

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

Recommendations

• Minimizing tardy jobs in a flowshop with common due date
• A note on a due-date assignment on a two-machine flow-shop
• On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

zbMATH Keywords

metaheuristicsschedulingflowshopcommon due datedue date setting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• Tabu search for total tardiness minimization in flowshop scheduling problems
• Variable neighborhood search
• The Complexity of Flowshop and Jobshop Scheduling
• Title not available (Why is that?)
• Variable neighborhood search: Principles and applications
• Scheduling in flowshops to minimize total tardiness of jobs
• A comprehensive review and evaluation of permutation flowshop heuristics
• Benchmarks for basic scheduling problems
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Design and analysis of experiments.
• Rescheduling on a single machine with part-type dependent setup times and deadlines
• Rescheduling for New Orders
• 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
• Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
• Title not available (Why is that?)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
• Parallel machines scheduling with nonsimultaneous machine available time
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
• The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs

Cited In (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

• Genocop

This page was built for publication: Setting a common due date in a constrained flowshop: a variable neighbourhood search approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976037)