TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS

DOI10.15807/jorsj.29.123zbMath0611.90059OpenAlexW2726770037WikidataQ113233897 ScholiaQ113233897MaRDI QIDQ3751358

Toshio Nishida, Hiroaki Ishii

Publication date: 1986

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.29.123

zbMATH Keywords

maximum completion timebinary searchmachine speedstwo-machine open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

One machine scheduling problem with fuzzy duedates ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival ⋮ Optimal choice of machine speeds for two-stage non-homogeneous systems ⋮ Optimal makespan scheduling with given bounds of processing times ⋮ Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost ⋮ Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan ⋮ Single machine scheduling with controllable release and processing parameters ⋮ Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds

This page was built for publication: TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS