Two-machine ordered flow shop scheduling with generalized due dates

DOI10.1142/S0217595919500325MaRDI QIDQ5216799zbMATH OpenOpenAlexWikidataFDO

Authors Myoung-Ju Park, Byung-Cheon Choi, Yunhong Min, Kyung Min Kim

Publication date 20 February 2020

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0217595919500325

zbMATH Keywords

computational complexityschedulingordered flow shopgeneralized due dates

Mathematics Subject Classification ID

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

Recommendations

• Scheduling with generalized and periodic due dates under single- and two-machine environments
• Two-machine flow shop scheduling with nonregular criteria
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• A note on a due-date assignment on a two-machine flow-shop
• Minmax due-date assignment on a two-machine flowshop

Cites work

• scientific article; zbMATH DE number 4172724 (Why is no real title available?)
• scientific article; zbMATH DE number 167292 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A note on the SPT heuristic for solving scheduling problems with generalized due dates
• An ordered flow shop with two agents
• Flowshop Sequencing Problem with Ordered Processing Time Matrices
• Flowshop sequencing problem with ordered processing time matrices: A general case
• Just-in-time scheduling with generalized due dates and identical due date intervals
• On the complexity of generalized due date scheduling problems
• Online scheduling of ordered flow shops
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Outsourcing decisions in \(m\)-machine permutation flow shop scheduling problems with machine-dependent processing times
• Review of the ordered and proportionate flow shop scheduling research
• Single machine scheduling with assignable due dates
• Two-machine and two-agent flow shop with special processing times structures
• Unary NP-hardness of minimizing total weighted tardiness with generalized due dates

Cited in

(8)

• Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs
• scientific article; zbMATH DE number 3914067 (Why is no real title available?)
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
• Minmax due-date assignment on a two-machine flowshop
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
• Scheduling with generalized and periodic due dates under single- and two-machine environments
• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
• A note on a due-date assignment on a two-machine flow-shop

This page was built for publication: Two-machine ordered flow shop scheduling with generalized due dates

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