An algorithm for the maximum revenue jobshop problem
From MaRDI portal
Publication:958087
DOI10.1016/j.ejor.2007.11.039zbMath1160.90480MaRDI QIDQ958087
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
Related Items
An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan, Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan
Cites Work
- Unnamed Item
- 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
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
- The complexity of cyclic shop scheduling problems
- 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
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Performance Measures and Schedules in Periodic Job Shops
- Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
- Scheduling jobshops with some identical or similar jobs