Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times

DOI10.1016/J.DISOPT.2024.100845zbMATH Open1547.90077MaRDI QIDQ6602333FDOQ6602333

Authors: Nadia Babou, Mourad Boudhar, Djamal Rebaine 

Publication date: 11 September 2024

Published in: Discrete Optimization (Search for Journal in Brave)

Recommendations

• Two-machine open shop problem with a single server and set-up time considerations
• Two-machine flow shop problems with a single server
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Scheduling a single server in a two-machine flow shop
• Scheduling two parallel machines with a single server: the general case

zbMATH Keywords

complexityschedulingjob shopmeta-heuristicserverset-up times

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Optimal two- and three-stage production schedules with set-up time included
• The Complexity of Flowshop and Jobshop Scheduling
• The significance of reducing setup times/setup costs
• Complexity results for flow-shop problems with a single server
• Complexity results for parallel machine problems with a single server
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• On a two-machine flow-shop scheduling problem with a single server and unit processing times
• Scheduling a single server in a two-machine flow shop
• Scheduling for parallel dedicated machines with a single server
• Two-machine flow shop problems with a single server
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
• Two-machine open shop problem with a single server and set-up time considerations
• Solving the two-machine open shop problem with a single server with respect to the makespan

Cited In (1)

• Solving the two-machine open shop problem with a single server with respect to the makespan

This page was built for publication: Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602333)