Single machine scheduling to minimize weighted earliness subject to no tardy jobs

DOI10.1016/0377-2217(88)90356-6zbMATH Open0648.90036OpenAlexW2059340828MaRDI QIDQ1105480FDOQ1105480

Authors: Suresh Chand, Hans Schneeberger 

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90356-6

Recommendations

• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems

zbMATH Keywords

heuristicweighted completion timedynamic goal programmingno tardy jobsweighted earliness problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Title not available (Why is that?)
• A note on a scheduling problem with dual criteria
• A note on the extension of a result on scheduling with secondary criteria
• A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
• ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM
• Scheduling to minimize the weighted sum of completion times with secondary criteria
• ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA

Cited In (31)

• Finding efficient make-to-order production and batch delivery schedules
• Single machine scheduling with flow time and earliness penalties
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
• Furniture supply chain tactical planning optimization using a time decomposition approach
• Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
• A fixed interval due-date scheduling problem with earliness and due-date costs
• On the Bellman's principle of optimality
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
• A note on single-machine scheduling with decreasing time-dependent job processing times
• A no-delay single machine scheduling problem to minimize total weighted early and late work
• Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
• Minimizing mean squared deviation of completion times with maximum tardiness constraint
• Title not available (Why is that?)
• Considerations of single-machine scheduling with deteriorating jobs
• Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain
• Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
• Greedy randomized adaptive search procedures
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Multicriteria scheduling problems: a survey
• Single machine scheduling problems with deteriorating jobs
• On the fixed interval due-date scheduling problem
• Medium term production management for cyclic deliveries
• Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
• Some single-machine scheduling problems with general effects of learning and deterioration
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
• Algorithm for minimizing weighted earliness penalty in single-machine problem
• Mathematical Modeling of Scheduling Problems
• Counting and enumeration complexity with application to multicriteria scheduling
• Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

This page was built for publication: Single machine scheduling to minimize weighted earliness subject to no tardy jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105480)