A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
type: Item
instance of: scholarly article
title: A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
zbMATH Open document ID: 1426.90133
author: Seyed Reza Hejazi
author: Mohammad Mahdavi Mazdeh
author: Morteza Rasti Barzoki
published in: Applied Mathematical Modelling
publication date: 2018-08-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6929755
zbMATH Keywords: supply chain scheduling
zbMATH Keywords: distribution
zbMATH Keywords: batch delivery
zbMATH Keywords: tardy jobs
MaRDI profile type: Publication
full work available at URL: j.apm.2012.10.001
OpenAlex ID: W1983544204
cites work: The coordination of transportation and batching scheduling
cites work: Integrated Production and Outbound Distribution Scheduling: Review and Extensions
cites work: Single-machine batch scheduling minimizing weighted flow times and delivery costs
cites work: Supply Chain Scheduling: Batching and Delivery
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Reducibility among Combinatorial Problems
cites work: Algorithms for Scheduling Independent Tasks
cites work: Fast approximation algorithm for job sequencing with deadlines
cites work: Q3907409
cites work: Minimizing the weighted number of tardy jobs on a single machine
cites work: Minimizing the weighted number of tardy jobs on a single machine with release dates
cites work: Scheduling with batching: Minimizing the weighted number of tardy jobs
cites work: Q4873242
cites work: A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
cites work: Two-machine flowshop scheduling to minimize the number of tardy jobs
cites work: Flowshop scheduling with dominant machines
cites work: Minimizing the weighted number of tardy jobs on a two-machine flow shop.
cites work: Batch delivery scheduling with batch delivery cost on a single machine
cites work: A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
cites work: A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
cites work: Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
cites work: Q4124328
DOI: 10.1016/J.APM.2012.10.001
description: scientific article; zbMATH DE number 6929755