A two-machine flowshop problem with two agents
From MaRDI portal
Publication:709115
DOI10.1016/J.COR.2010.04.002zbMATH Open1231.90204OpenAlexW2081899110MaRDI QIDQ709115FDOQ709115
Authors: D. Kharzeev 
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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization by Simulated Annealing
- Sequencing games
- Title not available (Why is that?)
- 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
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Scheduling Problems with Two Competing Agents
- The Complexity of Flowshop and Jobshop Scheduling
- A note on the scheduling with two families of jobs
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Title not available (Why is that?)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- A note on the complexity of the problem of two-agent scheduling on a single machine
- On games corresponding to sequencing situations with ready times
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- A dual algorithm for the one-machine scheduling problem
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- Minimizing total completion time in two-machine flow shops with exact delays
- Two-machine flowshop scheduling to minimize mean flow time
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
Cited In (22)
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Total tardiness minimization in permutation flowshop with deterioration consideration
- 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-agent scheduling in a flowshop
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A scheduling problem with three competing agents
- Single machine scheduling with interfering job sets
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- 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 problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- A two-agent single-machine scheduling problem with late work criteria
- A two-machine no-wait flow shop problem with two competing agents
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
This page was built for publication: A two-machine flowshop problem with two agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709115)
