Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
From MaRDI portal
Publication:827243
DOI10.1007/S10479-019-03160-YzbMATH Open1455.90072OpenAlexW2914802811WikidataQ128431256 ScholiaQ128431256MaRDI QIDQ827243FDOQ827243
Authors: Jun Pei, Jinling Wei, Baoyu Liao, Panos M. Pardalos, Xinbao Liu 
Publication date: 7 January 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03160-y
Recommendations
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- scientific article; zbMATH DE number 7109369
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Bounded parallel-batching scheduling with two competing agents
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Competitive two-agent scheduling and its applications
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- Scheduling Problems with Two Competing Agents
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Multiagent scheduling. Models and algorithms
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Time-dependent scheduling
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- A single machine batch scheduling problem with bounded batch size
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- A concise survey of scheduling with time-dependent processing times
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Scheduling jobs with position-dependent processing times
- Scheduling problems with a learning effect
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Scheduling two agents with controllable processing times
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Two-agent scheduling on a single sequential and compatible batching machine
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
- Single machine two-agent scheduling with deteriorating jobs
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
- Batch scheduling of deteriorating reworkables
- A batch scheduling problem with two agents
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
Cited In (10)
- Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Patient scheduling with deteriorating treatment duration and maintenance activity
- Evolutionary game analysis on government subsidy policy and bank loan strategy in China's distributed photovoltaic market
- Optimization of scheduling problems with deterioration effects and an optional maintenance activity
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine
- Just-in-time single-batch-processing machine scheduling
- Less is more approach for competing groups scheduling with different learning effects
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain
This page was built for publication: Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827243)
