scientific article
From MaRDI portal
Publication:3883869
zbMath0441.90039MaRDI QIDQ3883869
Ghanshiam Das, Parkash Lal Maggu
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items
An improved two-machine flowshop scheduling with intermediate transportation ⋮ Machine scheduling with job delivery coordination ⋮ On a scheduling problem in a robotized analytical system ⋮ Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination ⋮ Complexity of problem \(TF2|v=1,c=2|C_{\max}\) ⋮ Flowshop scheduling with interstage job transportation ⋮ An improved approximation algorithm for single machine scheduling with job delivery ⋮ Coordinating multi-location production and customer delivery ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ Realistic two-stage flowshop batch scheduling problems with transportation capacity and times ⋮ Flow shop scheduling problems with transportation constraints revisited ⋮ UET flow shop scheduling with delays ⋮ A two-machine flowshop scheduling problem with a separated maintenance constraint ⋮ Hybrid flowshop scheduling with interstage job transportation ⋮ Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited ⋮ Single machine scheduling with release dates and job delivery to minimize the makespan ⋮ Analysis of heuristics for the UET two-machine flow shop problem with time delays ⋮ Machine scheduling with deliveries to multiple customer locations ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times ⋮ Transporting jobs through a two‐machine open shop ⋮ Two-machine flowshop group scheduling problem ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
