An algorithm for the maximum revenue jobshop problem

DOI10.1016/J.EJOR.2007.11.039zbMATH Open1160.90480OpenAlexW2162953579MaRDI QIDQ958087FDOQ958087

Tal Raviv, Michal Penn

Publication date: 2 December 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.039

Recommendations

• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• A fluid approach to large volume job shop scheduling
• Scheduling jobshops with some identical or similar jobs
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
• Scheduling a two-stage flowshop under makespan constraint

zbMATH Keywords

schedulingproduction

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cites Work

• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A simplex based algorithm to solve separated continuous linear programs
• The complexity of scheduling jobs in repetitive manufacturing systems
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• The complexity of cyclic shop scheduling problems
• Performance Measures and Schedules in Periodic Job Shops
• From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
• A Fluid Heuristic for Minimizing Makespan in Job Shops
• From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
• Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
• Scheduling jobshops with some identical or similar jobs
• Title not available (Why is that?)

Cited In (4)

• Scheduling jobs on a single machine to maximize the total revenue of jobs
• Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
• Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan

This page was built for publication: An algorithm for the maximum revenue jobshop problem

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