An efficient new heuristic for the hoist scheduling problem (Q342278): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6654131 / rank
 
Normal rank
Property / zbMATH Keywords
 
transportation resources
Property / zbMATH Keywords: transportation resources / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic scheduling
Property / zbMATH Keywords: dynamic scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed integer linear programming (MILP)
Property / zbMATH Keywords: mixed integer linear programming (MILP) / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristic
Property / zbMATH Keywords: heuristic / rank
 
Normal rank
Property / zbMATH Keywords
 
bounded processing times
Property / zbMATH Keywords: bounded processing times / rank
 
Normal rank
Property / zbMATH Keywords
 
initial products sequence
Property / zbMATH Keywords: initial products sequence / 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.cor.2015.10.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2183641468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization for the cyclic hoist scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with time windows in circuit board production lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between the physical layout of the work stations and the productivity of a saturated single-hoist production line / 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: Control of an electroplating line in the max and min algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for hoist scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single hoist cyclic scheduling with multiple tanks: A material handling solution / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:59, 12 July 2024

scientific article
Language Label Description Also known as
English
An efficient new heuristic for the hoist scheduling problem
scientific article

    Statements

    An efficient new heuristic for the hoist scheduling problem (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation resources
    0 references
    dynamic scheduling
    0 references
    mixed integer linear programming (MILP)
    0 references
    heuristic
    0 references
    bounded processing times
    0 references
    initial products sequence
    0 references
    0 references