A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems

Recommendations

Permutation vs. non-permutation flow shop schedules
On non-permutation solutions to some two machine flow shop scheduling problems
Permutation schedules for a two-machine flow shop with storage
On the combinatorial structure of the permutation flow shop problem
The two-machine permutation flow shop with state-dependent processing times

Cites work

A fast tabu search algorithm for the permutation flow-shop problem
A Non-Numerical Approach to Production Scheduling Problems
A survey of scheduling with controllable processing times
Critical-Path Planning and Scheduling: Mathematical Basis
Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
Fast heuristics for minimizing the makespan in non-permutation flow shops
scientific article; zbMATH DE number 2146482 (Why is no real title available?)
Learning curve parameter estimation beyond traditional statistics
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
New hard benchmark for flowshop scheduling problems minimising makespan
Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
Optimal two- and three-stage production schedules with set-up time included
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
Permutation vs. non-permutation flow shop schedules
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
Scheduling algorithms
Scheduling. Theory, algorithms, and systems.
Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
Solution of the Akers-Friedman Scheduling Problem
Synchronous flow shop scheduling with pliable jobs
The Complexity of Flowshop and Jobshop Scheduling
The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
Tight bounds for permutation flow shop scheduling
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops

Cited in

(12)

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
Diversity of processing times in permutation flow shop scheduling problems
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
scientific article; zbMATH DE number 4209899 (Why is no real title available?)
On the combinatorial structure of the permutation flow shop problem
A note on scheduling jobs with missing operations in permutation flow shops
scientific article; zbMATH DE number 232391 (Why is no real title available?)
A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect
Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users
An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop
Two-phase optimal and heuristic algorithms for flow shop scheduling with reworks under overlapped queue time limits

This page was built for publication: A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems

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