Lot streaming for a two-stage assembly system in the presence of handling costs

DOI10.1007/S10951-023-00777-7zbMath1520.90118MaRDI QIDQ6136078

Sarin, Subhash C., Niloy J. Mukherjee, Daniel A. Neira

Publication date: 28 August 2023

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

zbMATH Keywords

schedulingmakespanlot streaminghandling costmultiple lottwo-stage assembly shop

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times
• Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
• The two-stage assembly scheduling problem to minimize total completion time with setup times
• A branch and bound algorithm for the two-stage assembly scheduling problem
• Flow shop scheduling with lot streaming
• Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
• A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
• A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application
• Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Basic Techniques for Lot Streaming
• Optimal scheduling of the 3-machine assembly-type flow shop
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

This page was built for publication: Lot streaming for a two-stage assembly system in the presence of handling costs