A variant of the permutation flow shop model with variable processing times

DOI10.1016/S0166-218X(96)00121-7zbMath0882.90067MaRDI QIDQ1363747

H. Jiang, Gerd Finke

Publication date: 24 February 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

flow shopmakespan minimizationvariable processing timesgreedy placement algorithminfinite buffer capacities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A concise survey of scheduling with time-dependent processing times ⋮ Total completion time in a two-machine flowshop with deteriorating tasks ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem

Cites Work

• Unnamed Item
• Unnamed Item
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Optimal control of a class of DEDS: Flow-shops with state-dependent processing times
• Single machine scheduling with nonlinear cost functions
• Optimal two- and three-stage production schedules with setup times included
• Hierarchical Control Of The Two Processor Flow-Shop With State Dependent Processing Times: Complexity Analysis And Approximate Algorithms
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
• General flow-shop scheduling with resource constraints
• The two-machine permutation flow shop with state-dependent processing times
• Scheduling deteriorating jobs to minimize makespan
• Flow Shop Scheduling with Resource Flexibility
• Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: A variant of the permutation flow shop model with variable processing times