Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
type: Item
instance of: scholarly article
title: Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
zbMATH Open document ID: 1189.90071
author: Harun Aydilek
author: Ali Allahverdi
publication date: 2010-06-28T00:00:00Z
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5727641
zbMATH Keywords: scheduling
zbMATH Keywords: flowshop
zbMATH Keywords: total completion time
zbMATH Keywords: random and bounded processing times
MaRDI profile type: Publication
full work available at URL: j.camwa.2009.10.025
OpenAlex ID: W2049751087
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
cites work: Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
cites work: Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
cites work: On Johnson's Two-Machine Flow Shop with Random Processing Times
cites work: A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
cites work: Makespan-related criteria for comparing schedules in stochastic environments
cites work: Stochastic scheduling with optimal customer service
cites work: Johnson's problem with stochastic processing times and optimal service level
cites work: Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
cites work: AN EVOLUTIONARY ALGORITHM FOR PURE FUZZY FLOWSHOP SCHEDULING PROBLEMS
cites work: Optimal makespan scheduling with given bounds of processing times
cites work: Sequencing with uncertain numerical data for makespan minimisation
cites work: Two-machine flowshop minimum-length scheduling problem with random and bounded processing times
cites work: Schedule execution for two-machine flow-shop with interval processing times
cites work: Flowshop scheduling problem to minimize total completion time with random and bounded processing times
cites work: A survey of scheduling problems with setup times or costs
cites work: Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times
cites work: An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
cites work: An integrated production and maintenance model for one failure prone machine-finite capacity buffer system for perishable products with constant demand
DOI: 10.1016/J.CAMWA.2009.10.025
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5727641