Two-machine ordered flow shop scheduling with generalized due dates
DOI10.1142/S0217595919500325zbMATH Open1433.90067OpenAlexW2968175378WikidataQ127356807 ScholiaQ127356807MaRDI QIDQ5216799FDOQ5216799
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
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On the complexity of generalized due date scheduling problems
- Review of the ordered and proportionate flow shop scheduling research
- Title not available (Why is that?)
- Flowshop sequencing problem with ordered processing time matrices: A general case
- Title not available (Why is that?)
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- Single machine scheduling with assignable due dates
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
- Online scheduling of ordered flow shops
- Just-in-time scheduling with generalized due dates and identical due date intervals
- Outsourcing decisions in \(m\)-machine permutation flow shop scheduling problems with machine-dependent processing times
- Two-machine and two-agent flow shop with special processing times structures
- An ordered flow shop with two agents
Cited In (8)
- Title not available (Why is that?)
- 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
- Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs
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)
