Revenue maximization on parallel machines

DOI10.1007/978-3-642-00142-0_25zbMATH Open1209.91087OpenAlexW2277993837MaRDI QIDQ5392010FDOQ5392010

Authors: Jacek Juraszek, Erwin Pesch, Małgorzata Sterna 

Publication date: 7 April 2011

Published in: Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00142-0_25

Recommendations

• Scheduling jobs on a single machine to maximize the total revenue of jobs
• Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
• An algorithm for the maximum revenue jobshop problem
• Exact methods for order acceptance and scheduling on unrelated parallel machines
• Parallel-machine scheduling with release dates and rejection

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cited In (2)

• Scheduling jobs on a single machine to maximize the total revenue of jobs
• Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines

This page was built for publication: Revenue maximization on parallel machines

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