Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time (Q4230171): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1080/00207549608904988 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984297368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum lateness in a two-machine unit-time job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A state-of-the-art review of parallel-machine scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Textile Production Systems: a Succession of Non-identical Parallel Processor Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling open shops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and evaluation of static flowshop scheduling heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of scheduling algorithms for no-wait flowshops with parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution / rank
 
Normal rank

Latest revision as of 17:47, 28 May 2024

scientific article; zbMATH DE number 1256502
Language Label Description Also known as
English
Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
scientific article; zbMATH DE number 1256502

    Statements

    Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time (English)
    0 references
    0 references
    0 references
    13 December 1999
    0 references
    identical parallel machines
    0 references
    independent jobs
    0 references
    several serial workshops
    0 references
    0 references

    Identifiers