Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
type: Item
instance of: scholarly article
title: Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
zbMATH Open document ID: 0659.90057
DOI: 10.1016/0022-247X(88)90419-2
author: Chia-Shin Chung
author: Bidhu B. Mohanty
published in: Journal of Mathematical Analysis and Applications
publication date: 1988-01-01T00:00:00Z
review text: Longest expected processing time (LEPT) policy is a machine loading rule where out of all the jobs waiting to be processed by a machine, with their processing times following given probability distributions, the one with the largest expected processing time is chosen first. Using a method based on Markov process and dynamic programming, we show that a LEPT policy will minimize the expected makespan for a two-machine stochastic open shop with Poisson arrival for jobs. The processing time of any job at any machine is exponential. We assume that all jobs are identical but the two machines are not.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 4079157
zbMATH Keywords: Longest expected processing time
zbMATH Keywords: machine loading rule
zbMATH Keywords: Markov process
zbMATH Keywords: expected makespan
zbMATH Keywords: two-machine stochastic open shop
zbMATH Keywords: Poisson arrival
MaRDI profile type: Publication
cites work: Openshop and flowshop scheduling to minimize sum of completion times
cites work: Q4744042
cites work: An efficient algorithm for the job-shop problem with two jobs
cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
cites work: An Algorithm for the Open-Shop Problem
cites work: A Note on Open Shop Preemptive Schedules
cites work: Unit Execution Time Shop Problems
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
cites work: Minimizing Maximum Lateness in a Two-Machine Open Shop
cites work: Q3929047
cites work: On the complexity of preemptive open-shop scheduling problems
cites work: The mixed shop scheduling problem
cites work: Q3964013
cites work: Minimizing expected makespan in stochastic open shops
cites work: A note on the flow time and the number of tardy jobs in stochastic open shops
cites work: A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
cites work: Complexity of Scheduling Shops with No Wait in Process
cites work: Negative Dynamic Programming
cites work: Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan
full work available at URL: 0022-247x(88)90419-2
OpenAlex ID: W2020298013
description: scientific article; zbMATH DE number 4079157