Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
From MaRDI portal
Publication:1751665
DOI10.1016/j.ejor.2016.10.024zbMath1394.90310OpenAlexW2539408631MaRDI QIDQ1751665
Guo-Qiang Fan, Joseph Y.-T. Leung, Jun-Qiang Wang, Cheng-Wu Zhang, Ying-Qian Zhang
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.10.024
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (17)
Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Integrated scheduling on parallel batch processing machines with non-identical capacities ⋮ Multitasking scheduling problems with two competitive agents ⋮ Scheduling with competing agents, total late work and job rejection ⋮ A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions ⋮ Mixed batch scheduling on identical machines ⋮ A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan ⋮ Two-agent scheduling on a single machine with release dates ⋮ Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Vehicle scheduling problems with two agents on a line
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Scheduling one batch processor subject to job release dates
- Makespan minimization on single batch-processing machine via ant colony optimization
- Approximation schemes for two-agent scheduling on parallel machines
- Scheduling with batching: A review
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- A multiple-criterion model for machine scheduling
- Scheduling aircraft landings using airlines' preferences
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling a single batch processing machine with non-identical job sizes
- Multiagent Scheduling
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
