An algorithm for the maximum revenue jobshop problem (Q958087): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162953579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobshops with some identical or similar jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fluid Heuristic for Minimizing Makespan in Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cyclic shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of a NP-hard cyclic scheduling problem: The recurrent job-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling jobs in repetitive manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Measures and Schedules in Periodic Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex based algorithm to solve separated continuous linear programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:54, 28 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for the maximum revenue jobshop problem
scientific article

    Statements

    An algorithm for the maximum revenue jobshop problem (English)
    0 references
    0 references
    0 references
    2 December 2008
    0 references
    0 references
    production
    0 references
    scheduling
    0 references
    0 references