A scheduling game on parallel batch machines with setup cost

DOI10.1007/S10951-025-00863-YMaRDI QIDQ7288390zbMATH OpenFDO

Authors Guo-Qiang Fan, Jun-Qiang Wang, Zhixin Liu

Publication date 30 June 2026

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10951-025-00863-Y

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80)

Cites work

• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
• A coordination mechanism for a scheduling game with parallel-batching machines
• A coordination mechanism for a scheduling game with uniform-batching machines
• A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
• A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
• A note on a selfish bin packing problem
• Automata, Languages and Programming
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• Conflicting congestion effects in resource allocation games
• Coordination mechanisms for scheduling games with proportional deterioration
• Coordination mechanisms for selfish scheduling
• Cost-sharing mechanisms for selfish bin packing
• Cost-sharing scheduling games on restricted unrelated machines
• Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
• Efficiency analysis of load balancing games with and without activation costs
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Improved bounds for batch scheduling with nonidentical job sizes
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• Inefficiency of equilibria for scheduling game with machine activation costs
• Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Minimizing makespan on a single burn-in oven in semiconductor manufacturing
• Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
• Non-clairvoyant scheduling games
• Optimal coordination mechanisms for unrelated machine scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Price of fairness in two-agent single-machine scheduling problems
• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling games on uniform machines with activation cost
• Selfish bin packing
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines
• The significance of reducing setup times/setup costs
• The structure and complexity of Nash equilibria for a selfish routing game
• The third comprehensive survey on scheduling problems with setup times/costs
• Using weight decision for decreasing the price of anarchy in selfish bin packing games
• Worst-case equilibria

This page was built for publication: A scheduling game on parallel batch machines with setup cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288390)