An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2011.10.020 / 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: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6066826 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
single machine
Property / zbMATH Keywords: single machine / rank
 
Normal rank
Property / zbMATH Keywords
 
bottleneck decomposition
Property / zbMATH Keywords: bottleneck decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
subproblem solution
Property / zbMATH Keywords: subproblem solution / rank
 
Normal rank
Property / zbMATH Keywords
 
branch and bound
Property / zbMATH Keywords: branch and bound / 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.1016/j.ejor.2011.10.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051947812 / 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: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single machine to minimize a regular objective function under setup constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / 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: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure for the one-machine sequencing problem with dependent jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted tardiness in a generalized job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem / 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: Dominance rules in combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance-based heuristics for one-machine total cost scheduling problems / 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: Q4055377 / 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: A general approach for optimizing regular criteria in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling Polyhedra with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for large job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-Machine Lower Bounds for Shop-Scheduling Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2011.10.020 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:38, 9 December 2024

scientific article
Language Label Description Also known as
English
An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
scientific article

    Statements

    An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    scheduling
    0 references
    single machine
    0 references
    bottleneck decomposition
    0 references
    subproblem solution
    0 references
    branch and bound
    0 references
    0 references
    0 references
    0 references

    Identifiers