ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES

DOI10.15807/jorsj.24.136zbMath0459.90033OpenAlexW1567872526MaRDI QIDQ3910286

Ravinder Kumar, Parkash Lal Maggu, Ghanshiam Das

Publication date: 1981

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.24.136

zbMATH Keywords

2xn sequencing problemequivalent-jobs for job-blocksoptimal schedule principletransportation-times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Machine scheduling with job delivery coordination ⋮ A two-stage flow shop scheduling problem with transportation considerations ⋮ Machine scheduling with deliveries to multiple customer locations ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ Optimization of processing and delivery decisions involving third-party machines ⋮ A decomposition theory based on a dominance relation and composite jobs ⋮ Clustered flow shop models ⋮ 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

This page was built for publication: ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES