Family scheduling with batch availability in flow shops to minimize makespan
type: Item
instance of: scholarly article
title: Family scheduling with batch availability in flow shops to minimize makespan
zbMATH Open document ID: 1392.90067
author: Liji Shen
author: Jatinder N. D. Gupta
published in: Journal of Scheduling
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6859798
zbMATH Keywords: batching
zbMATH Keywords: scheduling
zbMATH Keywords: sequence dependency
zbMATH Keywords: tabu search
zbMATH Keywords: batch availability
zbMATH Keywords: inconsistent batches
MaRDI profile type: Publication
full work available at URL: s10951-017-0529-x
OpenAlex ID: W2616115487
cites work: The complexity of one-machine batching problems
cites work: The Reactive Tabu Search
cites work: An integrated tabu search algorithm for the lot streaming problem in job shops
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: One-machine batching and sequencing of multiple-type items
cites work: Single machine scheduling with batch deliveries
cites work: Batch sizing and job sequencing on a single machine
cites work: Flowshop scheduling research after five decades
cites work: Scheduling a two-stage hybrid flowshop with separable setup and removal times
cites work: Scheduling and lot streaming in flowshops with no-wait in process
cites work: Scheduling with batching: Minimizing the weighted number of tardy jobs
cites work: A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
cites work: Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
cites work: A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
cites work: Open-shop batch scheduling with identical jobs
cites work: Flow-shop batch scheduling with identical processing-time jobs
cites work: A comprehensive review of flowshop group scheduling literature
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Scheduling with batching: A review
cites work: Heuristics and sequence-dependent set-up jobs in flow line cells
cites work: Scheduling a flowline manufacturing cell with sequence dependent family setup times
cites work: Flow shop batching and scheduling with sequence-dependent setup times
cites work: A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
cites work: Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
DOI: 10.1007/S10951-017-0529-X
description: scientific article; zbMATH DE number 6859798