A linear programming-based method for job shop scheduling (Q2434310): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10951-012-0270-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085278304 / 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: A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of shifting bottleneck procedures for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Development and analysis of cost-based dispatching rules for job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast neighborhood search for the single machine earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large step random walk for minimizing total weighted tardiness in a job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of heuristics in a dynamic job shop with weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for large job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for scheduling in industrial and manufacturing applications / rank
 
Normal rank

Latest revision as of 07:32, 7 July 2024

scientific article
Language Label Description Also known as
English
A linear programming-based method for job shop scheduling
scientific article

    Statements

    A linear programming-based method for job shop scheduling (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    job shop
    0 references
    shifting bottleneck
    0 references
    intermediate inventory holding costs
    0 references
    non-regular objective
    0 references
    optimal timing problem
    0 references
    linear programming
    0 references
    sensitivity analysis
    0 references
    single machine
    0 references
    earliness/tardiness
    0 references
    0 references
    0 references

    Identifiers