Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
type: Item
instance of: scholarly article
title: Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
zbMATH Open document ID: 1480.90136
author: Baruch Mor
author: Gur Mosheiov
author: Dvir Shabtay
published in: Journal of Scheduling
publication date: 2022-01-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7457559
MaRDI profile type: Publication
full work available at URL: s10951-021-00697-4
OpenAlex ID: W3184810401
cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
cites work: A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
cites work: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
cites work: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
cites work: Minimizing Total Tardiness on One Machine is NP-Hard
cites work: On the complexity of generalized due date scheduling problems
cites work: On the parameterized tractability of single machine scheduling with rejection
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
cites work: Flowshop scheduling with learning effect and job rejection
cites work: Regular scheduling measures on proportionate flowshop with job rejection
cites work: A note on the SPT heuristic for solving scheduling problems with generalized due dates
cites work: Single machine scheduling with assignable due dates
cites work: Algorithms for Scheduling Independent Tasks
cites work: Q5091069
cites work: A bicriteria approach to scheduling a single machine with job rejection and positional penalties
cites work: A survey on offline scheduling with rejection
cites work: Minimizing total weighted completion time in a proportionate flow shop
cites work: Q3197606
cites work: Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
cites work: Two-agent single-machine scheduling with assignable due dates
cites work: Single-machine scheduling under the job rejection constraint
DOI: 10.1007/S10951-021-00697-4
Recommended article: Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
Recommended article: Minimizing tardy jobs in a flowshop with common due date
Recommended article: Minimizing total weighted tardiness in a generalized job shop
Recommended article: Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
Recommended article: Scheduling in flowshops to minimize total tardiness of jobs
Recommended article: Minimizing maximum lateness in a flow shop subject to release dates
Recommended article: Minimizing the expected weighted number of tardy jobs in stochastic flow shops
Recommended article: The proportionate flow shop total tardiness problem
Recommended article: Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
Recommended article: A new rule for minimizing the number of tardy jobs in dynamic flow shops
description: scientific article; zbMATH DE number 7457559