Family scheduling with batch availability in flow shops to minimize makespan

DOI10.1007/s10951-017-0529-xzbMath1392.90067OpenAlexW2616115487MaRDI QIDQ1743654

Liji Shen, Jatinder N. D. Gupta

Publication date: 13 April 2018

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

Full work available at URL: https://doi.org/10.1007/s10951-017-0529-x

zbMATH Keywords

schedulingtabu searchbatchingbatch availabilityinconsistent batchessequence dependency

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)

Learning-augmented heuristics for scheduling parallel serial-batch processing machines ⋮ Preface

Cites Work

• Flow shop batching and scheduling with sequence-dependent setup times
• Batch sizing and job sequencing on a single machine
• An integrated tabu search algorithm for the lot streaming problem in job shops
• A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
• Single machine scheduling with batch deliveries
• 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
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Scheduling and lot streaming in flowshops with no-wait in process
• Scheduling a flowline manufacturing cell with sequence dependent family setup times
• A comprehensive review of flowshop group scheduling literature
• A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
• Scheduling with batching: A review
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Open-shop batch scheduling with identical jobs
• Flowshop scheduling research after five decades
• Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
• Flow-shop batch scheduling with identical processing-time jobs
• Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
• The Reactive Tabu Search
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Heuristics and sequence-dependent set-up jobs in flow line cells
• Scheduling Groups of Jobs on a Single Machine
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Family scheduling with batch availability in flow shops to minimize makespan