An Ordered Flow Shop with Two Agents

DOI10.1142/S0217595916500378zbMath1354.90048OpenAlexW2523479771MaRDI QIDQ5506757

Myoung-Ju Park, Byung-Cheon Choi

Publication date: 16 December 2016

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

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

zbMATH Keywords

schedulingordered flow shopmulti-agent sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates

Cites Work

• Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
• Single-machine scheduling with two competing agents and learning consideration
• Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Two-agent single-machine scheduling with assignable due dates
• Single-machine multi-agent scheduling problems with a global objective function
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Scheduling Problems with Two Competing Agents
• Flowshop Sequencing Problem with Ordered Processing Time Matrices

This page was built for publication: An Ordered Flow Shop with Two Agents