A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

DOI10.1287/MNSC.16.10.B630zbMath0194.50504MaRDI QIDQ5590535

Milton L. Smith, Hugh G. Campbell, R. Dudek

Publication date: 1970

Published in: Management Science (Search for Journal in Brave)

zbMATH Keywords

operations research

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

Optimal versus heuristic scheduling of surface mount technology lines ⋮ A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem ⋮ An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion ⋮ Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ Flowshop sequencing problems with limited buffer storage ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ A survey and evaluation of static flowshop scheduling heuristics ⋮ A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria ⋮ Comparison of heuristics for flowtime minimisation in permutation flowshops ⋮ A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ Design and scheduling of flexible assembly lines for printed circuit boards ⋮ Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study ⋮ A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ Scheduling experiments on a nulear reactor using mixed integer programming ⋮ Flow shop-sequencing problem with synchronous transfers and makespan minimization ⋮ Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs ⋮ A heuristic algorithm to schedule work in the repair industry ⋮ Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance ⋮ Sequencing a hybrid two-stage flowshop with dedicated machines ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop ⋮ FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors ⋮ An improved branch and bound procedure for scheduling a flow line manufacturing cell ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ Sequencing and loading of products on a flowline ⋮ Flexible flow shop scheduling with uniform parallel machines ⋮ Some aspects of scatter search in the flow-shop problem ⋮ Applying machine based decomposition in 2-machine flow shops ⋮ A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach ⋮ Performance guarantees for flowshop heuristics to minimize makespan ⋮ Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time ⋮ On the robustness of using balanced part mix ratios to determine cyclic part input sequences into flexible flow systems ⋮ Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1 ⋮ Permutation flowshop scheduling problems with maximal and minimal time lags ⋮ Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests ⋮ Scheduling flexible flow lines with sequence-dependent setup times ⋮ A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines ⋮ A neuro-tabu search heuristic for the flow shop scheduling problem ⋮ A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem ⋮ The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems ⋮ An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Job-shop production scheduling with reverse flows ⋮ On heuristic solutions for the stochastic flowshop scheduling problem ⋮ Lot streaming in the two-machine flow shop with setup times ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints ⋮ A new approach to two-machine flow shop problem with uncertain processing times ⋮ A new integer programming formulation for the permutation flowshop problem ⋮ Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions ⋮ Worst-case analysis of an approximation algorithm for flow-shop scheduling ⋮ Optimal fuzzy counterparts of scheduling rules ⋮ A discrete version of particle swarm optimization for flowshop scheduling problems ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ Considering scheduling and preventive maintenance in the flowshop sequencing problem ⋮ Flowshop sequencing with mean flowtime objective ⋮ Sequence optimization and design of allocation using GA and SA ⋮ Heuristics for scheduling in flowshop with multiple objectives ⋮ A heuristic algorithm for mean flowtime objective in flowshop scheduling ⋮ Heuristic procedures for minimizing makespan and the number of required pallets ⋮ Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. ⋮ Total flowtime in no-wait flowshops with separated setup times. ⋮ A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. ⋮ A contribution to the stochastic flow shop scheduling problem. ⋮ The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem ⋮ New heuristics for no-wait flowshops to minimize makespan. ⋮ Minimizing the makespan for the flow shop scheduling problem with availability constraints. ⋮ Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. ⋮ An improved NEH-based heuristic for the permutation flowshop problem ⋮ An ant colony system for permutation flow-shop sequencing ⋮ A Lagrangean relaxation approach for the mixed-model flow line sequencing problem ⋮ Flow shop batching and scheduling with sequence-dependent setup times ⋮ Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ Family scheduling with batch availability in flow shops to minimize makespan ⋮ A bicriteria flowshop scheduling with a learning effect

This page was built for publication: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem