A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
type: Item
instance of: scholarly article
title: A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
zbMATH Open document ID: 1487.90318
author: Daniel A. Rossit
author: Mariano Frutos
author: Martín D. Safe
author: Oscar C. Vásquez
author: Fernando Tohmé
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7354500
zbMATH Keywords: non-permutation flow shop scheduling problem
zbMATH Keywords: makespan
zbMATH Keywords: critical path
zbMATH Keywords: unknown processing times
zbMATH Keywords: structural and dominance properties
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.07.055
OpenAlex ID: W2966696224
cites work: A Non-Numerical Approach to Production Scheduling Problems
cites work: Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
cites work: Fast heuristics for minimizing the makespan in non-permutation flow shops
cites work: Q3425131
cites work: Synchronous flow shop scheduling with pliable jobs
cites work: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
cites work: Q4658190
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Critical-Path Planning and Scheduling: Mathematical Basis
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Tight Bounds for Permutation Flow Shop Scheduling
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production
cites work: Scheduling
cites work: Permutation vs. non-permutation flow shop schedules
cites work: Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
cites work: A survey of scheduling with controllable processing times
cites work: Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
cites work: Solution of the Akers-Friedman Scheduling Problem
cites work: Learning curve parameter estimation beyond traditional statistics
cites work: New hard benchmark for flowshop scheduling problems minimising makespan
cites work: Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
cites work: Single-machine scheduling with convex resource dependent processing times and deteriorating jobs
cites work: Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
DOI: 10.1016/J.EJOR.2019.07.055
description: scientific article; zbMATH DE number 7354500