TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS

DOI10.15807/JORSJ.29.123MaRDI QIDQ3751358zbMATH OpenOpenAlexWikidataFDO

Authors 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

binary searchmachine speedsmaximum completion timetwo-machine open shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Two machine mixed shop scheduling problem with controllable machine speeds
• Two-machine open shop problem with controllable processing times
• An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• scientific article; zbMATH DE number 930117

Cited in

(19)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• One machine scheduling problem with fuzzy duedates
• Optimal makespan scheduling with given bounds of processing times
• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• The two-machine open shop problem: To fit or not to fit, that is the question
• Two machine mixed shop scheduling problem with controllable machine speeds
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Single machine scheduling with controllable release and processing parameters
• Two-machine open shop problem with controllable processing times
• The two-machine no-wait general and proportionate open shop makespan problem
• Optimal choice of machine speeds for two-stage non-homogeneous systems
• Scheduling Multiple Variable-Speed Machines
• An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
• scientific article; zbMATH DE number 5260089 (Why is no real title available?)
• 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
• Two machine openshop scheduling with machine-dependent processing times
• On-line single machine scheduling of unit time jobs with rejection: minimizing the maximum quadratic completion time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751358)