A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups

DOI10.1007/s10951-013-0315-3zbMath1305.90201OpenAlexW2083578364MaRDI QIDQ490356

Udo Buscher, Lars Mönch, Liji Shen

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0315-3

zbMATH Keywords

schedulingparallel machinesbatchingVNSfamily setups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Flow shop batching and scheduling with sequence-dependent setup times ⋮ A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines

Cites Work

• An iterative approach for the serial batching problem with parallel machines and job families
• Batch sizing and job sequencing on a single machine
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
• The complexity of one-machine batching problems
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
• One-machine batching and sequencing of multiple-type items
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
• Variable neighborhood search
• Total flowtime in no-wait flowshops with separated setup times.
• Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times
• Scheduling with batching: A review
• A survey of scheduling problems with setup times or costs
• Flow-shop batch scheduling with identical processing-time jobs
• Job lateness in flowshops with setup and removal times separated
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On the Complexity of Scheduling with Batch Setup Times
• Heuristics and sequence-dependent set-up jobs in flow line cells
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• Variable neighborhood search: Principles and applications

This page was built for publication: A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups