An improved two-machine flowshop scheduling with intermediate transportation
From MaRDI portal
Recommendations
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
- On two machine flow-shop scheduling problem with transportation time of job
- A two-stage flow shop scheduling problem with transportation considerations
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- Scheduling of a Two-machine Flowshop with Travel Time Between Machines
- Flowshop scheduling with interstage job transportation
- Improved approximation algorithms for two-stage flowshops scheduling problem
- An improved algorithm for the two machine flow shop problem with several availability constraints
- An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3689114 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- A 71/60 theorem for bin packing
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- Bin packing can be solved within 1+epsilon in linear time
- Machine scheduling with job delivery coordination
- Machine scheduling with transportation considerations
- On the machine scheduling problem with job delivery coordination
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes
- Single machine scheduling with batch deliveries
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
Cited in
(8)- Flow shop scheduling problems with transportation constraints revisited
- Transporting jobs through a two‐machine open shop
- Optimal algorithms for flow shop schedule with transporter
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER
- Scheduling in manufacturing with transportation: classification and solution techniques
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
- Cooperative game theory based coordinated scheduling of two-machine flow-shop and transportation
- Flow shop scheduling problems with transportation constraints revisited
This page was built for publication: An improved two-machine flowshop scheduling with intermediate transportation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266074)
