Bounded parallel-batching scheduling with two competing agents
From MaRDI portal
Publication:2434316
DOI10.1007/s10951-012-0274-0zbMath1280.90043OpenAlexW4236206281MaRDI QIDQ2434316
Qi Feng, Baoqiang Fan, Cheng, T. C. Edwin, Shi-Sheng Li
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-012-0274-0
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (18)
Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multitasking scheduling problems with two competitive agents ⋮ Two-agent scheduling in a flowshop ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan ⋮ Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ 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 parallel-batching machine with equal processing time and non-identical job sizes ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ Two-agent scheduling on a single machine with release dates ⋮ Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ A survey of scheduling with parallel batch (p-batch) processing
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent scheduling to minimize the total cost
- On the complexity of bi-criteria scheduling on a single batch processing machine
- Scheduling two agents with controllable processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Scheduling a batching machine
- Batching identical jobs
- Complexity results for single-machine problems with positive finish-start time-lags
- Scheduling with batching: A review
- Minimizing total completion time on a batch processing machine with job families
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Unbounded parallel-batching scheduling with two competitive agents
- 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
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
This page was built for publication: Bounded parallel-batching scheduling with two competing agents
