An algorithm for the maximum revenue jobshop problem
type: Item
instance of: scholarly article
title: An algorithm for the maximum revenue jobshop problem
zbMATH Open document ID: 1160.90480
author: Michal Penn
author: Tal Raviv
published in: European Journal of Operational Research
publication date: 2008-12-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 5376956
zbMATH Keywords: production
zbMATH Keywords: scheduling
MaRDI profile type: Publication
full work available at URL: j.ejor.2007.11.039
OpenAlex ID: W2162953579
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
cites work: From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
cites work: From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
cites work: Scheduling jobshops with some identical or similar jobs
cites work: A Fluid Heuristic for Minimizing Makespan in Job Shops
cites work: Q4471274
cites work: The complexity of cyclic shop scheduling problems
cites work: Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
cites work: The complexity of scheduling jobs in repetitive manufacturing systems
cites work: Performance Measures and Schedules in Periodic Job Shops
cites work: A simplex based algorithm to solve separated continuous linear programs
DOI: 10.1016/J.EJOR.2007.11.039
description: scientific article; zbMATH DE number 5376956