Schedule execution for two-machine flow-shop with interval processing times (Q2390053): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yuri N. Sotskov / rank
Normal rank
 
Property / author
 
Property / author: Yuri N. Sotskov / 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.mcm.2008.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113853416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastically minimizing the makespan in two-machine flow shops without blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Johnson's problem with stochastic processing times and optimal service level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastically minimizing total flowtime in flowshops with no waiting space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine ordered flowshop scheduling under random breakdowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal makespan scheduling with given bounds of processing times / 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: Approximation schemes for job shop scheduling problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling with jointly compressible setup and processing times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with controllable release dates and processing times: Makespan minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with uncertain numerical data for makespan minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean flow time minimization with given bounds of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling problem to minimize total completion time with random and bounded processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times / 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: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret solutions for minimax optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:56, 1 July 2024

scientific article
Language Label Description Also known as
English
Schedule execution for two-machine flow-shop with interval processing times
scientific article

    Statements

    Schedule execution for two-machine flow-shop with interval processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 July 2009
    0 references
    0 references
    scheduling
    0 references
    flow-shop
    0 references
    makespan
    0 references
    uncertainty
    0 references
    dominant schedule
    0 references
    0 references
    0 references