An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines

DOI10.1016/j.ejor.2012.02.020zbMath1253.90115OpenAlexW2066552206MaRDI QIDQ1926814

Shrikant S. Panwalkar, Christos P. Koulamas

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.020

zbMATH Keywords

schedulingflow shopmulti-criteria problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Using hybrid GA-PSO algorithm to solve problem in machine scheduling ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ A constraint generation approach for two-machine shop problems with jobs selection ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines

Cites Work

• A matheuristic approach for the two-machine total completion time flow shop problem
• The three-machine proportionate flow shop problem with unequal machine speeds
• Scheduling shops to minimize the weighted number of late jobs
• Minimizing tardy jobs in a flowshop with common due date
• Optimal two- and three-stage production schedules with setup times included
• Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
• Principles of Sequencing and Scheduling
• Focused Scheduling in Proportionate Flowshops
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Two-machine flowshop scheduling to minimize the number of tardy jobs
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Flowshop-scheduling problems with makespan criterion: a review
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines