A variant of the permutation flow shop model with variable processing times
type: Item
instance of: scholarly article
title: A variant of the permutation flow shop model with variable processing times
zbMATH Open document ID: 0882.90067
DOI: 10.1016/S0166-218X(96)00121-7
author: H. Jiang
author: Gerd Finke
published in: Discrete Applied Mathematics
publication date: 1998-02-24T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1047170
zbMATH Keywords: makespan minimization
zbMATH Keywords: variable processing times
zbMATH Keywords: flow shop
zbMATH Keywords: infinite buffer capacities
zbMATH Keywords: greedy placement algorithm
MaRDI profile type: Publication
cites work: Single machine scheduling with nonlinear cost functions
cites work: Q3821925
cites work: Q4023677
cites work: Flow Shop Scheduling with Resource Flexibility
cites work: Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: General flow-shop scheduling with resource constraints
cites work: Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Scheduling deteriorating jobs to minimize makespan
cites work: Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
cites work: Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
cites work: The two-machine permutation flow shop with state-dependent processing times
cites work: Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
description: scientific article; zbMATH DE number 1047170