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-yzbMath1455.90072OpenAlexW2914802811WikidataQ128431256 ScholiaQ128431256MaRDI QIDQ827243
Jinling Wei, Jun Pei, Panos M. Pardalos, Baoyu Liao, Xin-Bao 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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
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 ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Just-in-time single-batch-processing machine scheduling ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Auction-based approach to the job-shop problem with parallel batch processing and a machine availability constraint ⋮ Optimization of scheduling problems with deterioration effects and an optional maintenance activity ⋮ Less is more approach for competing groups scheduling with different learning effects ⋮ Research on the impact of green innovation alliance mode on decision-making of two-cycle closed-loop supply chain
Cites Work
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Two-agent single-machine scheduling problems under increasing linear deterioration
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- Time-dependent scheduling
- Scheduling two agents with controllable processing times
- A concise survey of scheduling with time-dependent processing times
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- 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
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- A multiple-criterion model for machine scheduling
- A single machine batch scheduling problem with bounded batch size
- Multi-agent scheduling on a single machine with max-form criteria
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- Batch scheduling of deteriorating reworkables
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- A Batch Scheduling Problem with Two Agents
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Two‐agent scheduling on a single sequential and compatible batching machine
- Scheduling jobs with position-dependent processing times
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
- Multiagent Scheduling
- Single Machine Two-Agent Scheduling with Deteriorating Jobs
- Scheduling problems with a learning effect
This page was built for publication: Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
