Risk measure of job shop scheduling with random machine breakdowns
type: Item
instance of: scholarly article
title: Risk measure of job shop scheduling with random machine breakdowns
zbMATH Open document ID: 1458.90374
author: Zigao Wu
author: Shichang Xiao
author: Shudong Sun
published in: Computers \& Operations Research
publication date: 2018-08-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6914683
zbMATH Keywords: scheduling
zbMATH Keywords: job shop
zbMATH Keywords: schedule risk
zbMATH Keywords: risk measure
zbMATH Keywords: machine breakdown
MaRDI profile type: Publication
full work available at URL: j.cor.2018.05.022
OpenAlex ID: W2805694036
cites work: A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
cites work: An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
cites work: A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
cites work: Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
cites work: Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
cites work: The Price of Robustness
cites work: Scheduling deteriorating jobs on a single machine subject to breakdowns
cites work: Integrated production scheduling and maintenance policy for robustness in a single machine
cites work: A genetic algorithm for the job shop problem
cites work: A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
cites work: A generic deadlock-free reactive scheduling approach
cites work: Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
cites work: Minimizing total weighted completion time with an unexpected machine unavailable interval
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Minimizing makespan on a single machine subject to random breakdowns
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Minimizing makespan for scheduling stochastic job shop with random breakdown
cites work: Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
cites work: Rescheduling strategies for minimizing total weighted tardiness in complex job shops
cites work: Scheduling
cites work: Single–machine scheduling with random machine breakdowns and randomly compressible processing times
cites work: Analysis of reactive scheduling problems in a job shop environment
cites work: Single machine stochastic JIT scheduling problem subject to machine breakdowns
cites work: Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
cites work: A survey of maintenance policies of deteriorating systems
cites work: A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
cites work: Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
cites work: An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns
cites work: Stochastic scheduling problems with general position-based learning effects and stochastic breakdowns
DOI: 10.1016/J.COR.2018.05.022
description: scientific article; zbMATH DE number 6914683