Two-machine flow shop scheduling problem with an outsourcing option (Q421578): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ji-Bok Chung / rank
Normal rank
 
Property / author
 
Property / author: Ji-Bok Chung / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6035039 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
outsourcing
Property / zbMATH Keywords: outsourcing / rank
 
Normal rank
Property / zbMATH Keywords
 
ordered flow shop
Property / zbMATH Keywords: ordered flow shop / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / 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.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982863414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition and Outsourcing with Scale Economies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in an ordered flow shop with machine-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-machine proportionate flow shop problem with unequal machine speeds / 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: A note on the proportionate flow shop with a bottleneck machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused Scheduling in Proportionate Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop Sequencing Problem with Ordered Processing Time Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problem with ordered processing time matrices: A general case / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Two-machine flow shop scheduling problem with an outsourcing option
scientific article

    Statements

    Two-machine flow shop scheduling problem with an outsourcing option (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    scheduling
    0 references
    outsourcing
    0 references
    ordered flow shop
    0 references
    computational complexity
    0 references

    Identifiers