scientific article
From MaRDI portal
Publication:3358512
DOI<679::AID-NAV3220370507>3.0.CO;2-Q 10.1002/1520-6750(199010)37:5<679::AID-NAV3220370507>3.0.CO;2-QzbMath0731.90041MaRDI QIDQ3358512
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
traveling salesmanflow shopheuristiccyclic sequencingminimum- wait problemno-wait problemrepetitive cycleworst-case and average-case performance
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (17)
A job-splitting heuristic for lot-size scheduling in multi-stage, multi- product production processes ⋮ Cyclic scheduling to minimize inventory in a batch flow line ⋮ The interface of buffer design and cyclic scheduling decisions in deterministic flow lines ⋮ Some complexity results in cyclic scheduling ⋮ A fluid approach to large volume job shop scheduling ⋮ Two machine flow shop scheduling problem with weighted WIP costs ⋮ Flow shops with WIP and value added costs ⋮ Scheduling jobshops with some identical or similar jobs ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ The complexity of a cyclic scheduling problem with identical machines and precedence constraints ⋮ Scheduling in network flow shops ⋮ Sequencing and loading of products on a flowline ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Sequencing of robot activities and parts in two-machine robotic cells ⋮ The complexity of scheduling jobs in repetitive manufacturing systems ⋮ Study of a NP-hard cyclic scheduling problem: The recurrent job-shop ⋮ The complexity of cyclic shop scheduling problems
Cites Work
This page was built for publication:
