Algorithms for a two‐machine flowshop problem with jobs of two classes
From MaRDI portal
Publication:6090515
DOI10.1111/itor.12530OpenAlexW2791664283MaRDI QIDQ6090515
BongJoo Jeong, Sang-Oh Shim, Yeong-Dae Kim
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12530
Related Items
Coordination mechanisms for scheduling games with machine modification ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders ⋮ A two-machine no-wait flow shop problem with two competing agents
Cites Work
- Two-agent scheduling in a flowshop
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- A single-machine bi-criterion scheduling problem with two agents
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- A two-machine flowshop problem with two agents
- Minimizing total tardiness on a two-machine re-entrant flowshop
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Note on minimizing total tardiness in a two-machine flowshop
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Optimal two- and three-stage production schedules with setup times included
- A bi-criteria two-machine flowshop scheduling problem with a learning effect
- Scheduling Problems with Two Competing Agents
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Two-machine flowshop scheduling to minimize the number of tardy jobs
- No-wait flowshops with bicriteria of makespan and total completion time
- The Total Tardiness Problem: Review and Extensions
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Minimizing makespan on a two-machine re-entrant flowshop
This page was built for publication: Algorithms for a two‐machine flowshop problem with jobs of two classes
