Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-014-0376-y / rank
Normal rank
 
Property / author
 
Property / author: Tal Raviv / rank
Normal rank
 
Property / author
 
Property / author: Tal Raviv / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6389259 / rank
 
Normal rank
Property / zbMATH Keywords
 
optimization
Property / zbMATH Keywords: optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
jobshop
Property / zbMATH Keywords: jobshop / rank
 
Normal rank
Property / zbMATH Keywords
 
approximations
Property / zbMATH Keywords: approximations / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
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.1007/s10951-014-0376-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049093006 / 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 High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective / 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: Scheduling jobshops with some identical or similar jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for the complexity of high-multiplicity scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-Based Online Scheduling: From Single to Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Instability of Fluid Models for Reentrant Lines / 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: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501839 / 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: High-multiplicity cyclic job shop scheduling / 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: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some geometric methods in scheduling theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Scheduling in Order of α-Points on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of shop-scheduling problems with three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex based algorithm to solve separated continuous linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-014-0376-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
scientific article

    Statements

    Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (English)
    0 references
    0 references
    0 references
    22 January 2015
    0 references
    optimization
    0 references
    jobshop
    0 references
    approximations
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references

    Identifiers