Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-013-0334-0 / 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: 90C60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6331182 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-013-0334-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055832862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft car sequencing with colors: lower bounds and optimality proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlling mixed-model assembly lines in real-time by using distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on restricted instances of a paint shop problem for words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing mixed-model assembly lines: survey, classification and model critique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming to Minimize the Maximum Number of Open Stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on a paint shop problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching optimal resequencing and feature assignment on an automated assembly line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paintshop, odd cycles and necklace splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining two pheromone structures for solving the car sequencing problem with ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential ordering problem in automotive paint shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-013-0334-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:26, 9 December 2024

scientific article
Language Label Description Also known as
English
Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
scientific article

    Statements

    Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (English)
    0 references
    0 references
    0 references
    18 August 2014
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references