Optimal two- and three-stage production schedules with setup times included

DOI10.1002/NAV.3800010110zbMath1349.90359OpenAlexW2024085737MaRDI QIDQ2834736

No author found.

Publication date: 23 November 2016

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800010110

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (only showing first 100 items - show all)

The two-machine sequence dependent flowshop scheduling problem ⋮ A fast feasibility test for relocation problems ⋮ A two-machine flow shop scheduling problem with controllable job processing times ⋮ On no-wait and no-idle flow shops with makespan criterion ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time ⋮ A new approach to two-machine flow shop problem with uncertain processing times ⋮ A bicriteria flowshop scheduling problem with setup times ⋮ On relocation problems with multiple identical working crews ⋮ The two-machine flowshop scheduling problem with total tardiness ⋮ Simple heuristics for scheduling with limited intermediate storage ⋮ A new integer programming formulation for the permutation flowshop problem ⋮ k-optimal solution sets for some polynomially solvable scheduling problems ⋮ Worst-case analysis of an approximation algorithm for flow-shop scheduling ⋮ A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop ⋮ Optimal fuzzy counterparts of scheduling rules ⋮ Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times ⋮ Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach ⋮ Two-machine flow shop problems with a single server ⋮ A note on the two machine job shop with the weighted late work criterion ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ Minimizing total tardiness in permutation flowshops ⋮ Optimal lot streaming for multiple products in a two-machine flow shop ⋮ Shortest common superstrings and scheduling with coordinated starting times ⋮ Considering scheduling and preventive maintenance in the flowshop sequencing problem ⋮ Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function ⋮ Modified simulated annealing algorithms for the flow shop sequencing problem ⋮ Flowshop sequencing with mean flowtime objective ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ Fast discrete consensus based on gossip for makespan minimization in networked systems ⋮ Flowshop scheduling with interstage job transportation ⋮ Optimal control of a two-server flow-shop network ⋮ An adaptive branching rule for the permutation flow-shop problem ⋮ Sequencing with general precedence constraints ⋮ The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times ⋮ Discrete extremal problems ⋮ Job sequencing with fuzzy processing times ⋮ A survey of results for sequencing problems with controllable processing times ⋮ The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ Job lateness in a two-machine flowshop with setup times separated ⋮ Scheduling coordination problems in supply chain planning ⋮ Modeling realistic hybrid flexible flowshop scheduling problems ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ An efficient heuristic approach to the scheduling of jobs in a flowshop ⋮ Approximation results for flow shop scheduling problems with machine availability constraints ⋮ Flowshop scheduling problem with a batching machine and task compatibilities ⋮ Batching and scheduling in a multi-machine flow shop ⋮ A multi-stage parallel-processor flowshop problem with minimum flowtime ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Fuzzy job sequencing for a flow shop ⋮ Minimizing the total weighted completion time in the relocation problem ⋮ The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs ⋮ A parallel multiple reference point approach for multi-objective optimization ⋮ Throughput optimization in two-machine flowshops with flexible operations ⋮ Container sequencing for quay cranes with internal reshuffles ⋮ Flow shops with machine maintenance: ordered and proportionate cases ⋮ Scheduling hybrid flowshop with parallel batching machines and compatibilities ⋮ Minimizing makespan in two-stage hybrid cross docking scheduling problem ⋮ Scheduling reentrant jobs on parallel machines with a remote server ⋮ Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan ⋮ Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions ⋮ Johnson's rule, composite jobs and the relocation problem ⋮ A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops ⋮ Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem ⋮ Scheduling of a single crane in batch annealing process ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem ⋮ A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots ⋮ The two-machine total completion time flow shop problem ⋮ Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard ⋮ A genetic algorithm for flowshop scheduling with multiple objectives ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ The generalized shifting bottleneck procedure ⋮ Scheduling arrivals to a production system in a fuzzy environment ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times ⋮ A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines ⋮ The flow shop problem with no-idle constraints: a review and approximation ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ Variants of the two machine flow shop problem connected with factorization of matrix functions ⋮ Sevast'yanov's algorithm for the flow-shop scheduling problem ⋮ Genetic algorithms for the two-stage bicriteria flowshop problem ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs ⋮ Heuristic for scheduling in a Kanban system with dual blocking mechanisms ⋮ A branch and bound algorithm for the two-stage assembly scheduling problem ⋮ Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine ⋮ The distributed permutation flowshop scheduling problem ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals ⋮ Scheduling jobs under decreasing linear deterioration ⋮ Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop ⋮ The mixed shop scheduling problem

This page was built for publication: Optimal two- and three-stage production schedules with setup times included