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

DOI10.1016/S0166-218X(96)00121-7zbMATH Open0882.90067MaRDI QIDQ1363747FDOQ1363747

Authors: 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

Recommendations

• Flow shop scheduling with flexible processing times
• The two-machine permutation flow shop with state-dependent processing times
• A permutation flow-shop scheduling problem with convex models of operation processing times
• Permutation schedules for a two-machine flow shop with storage

zbMATH Keywords

flow shopmakespan minimizationvariable processing timesgreedy placement algorithminfinite buffer capacities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (7)

• Flow shop scheduling with flexible processing times
• General Flowshop Models: Job Dependent Capacities, Job Overlapping and Deterioration
• Synchronous flow shop scheduling with pliable jobs
• A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
• Total completion time in a two-machine flowshop with deteriorating tasks
• A model to approximate transient performance of the flowshop
• A concise survey of scheduling with time-dependent processing times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363747)