A two-machine flowshop problem with two agents
From MaRDI portal
Publication:709115
DOI10.1016/j.cor.2010.04.002zbMath1231.90204OpenAlexW2081899110MaRDI QIDQ709115
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.04.002
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (21)
Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Two-agent scheduling in a flowshop ⋮ Single machine scheduling with interfering job sets ⋮ A scheduling problem with three competing agents ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ Algorithms for a two‐machine flowshop problem with jobs of two classes ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ A two-machine no-wait flow shop problem with two competing agents
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A note on the scheduling with two families of jobs
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Minimizing total completion time in two-machine flow shops with exact delays
- Sequencing games
- The two-machine total completion time flow shop problem
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- On games corresponding to sequencing situations with ready times
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Two-machine flowshop scheduling to minimize mean flow time
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Scheduling Problems with Two Competing Agents
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- A dual algorithm for the one-machine scheduling problem
- The Complexity of Flowshop and Jobshop Scheduling
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
This page was built for publication: A two-machine flowshop problem with two agents
