Scheduling problems with non-regular penalty functions - a review

MaRDI QIDQ1106097zbMATH OpenFDO

Authors M. Raghavachari

Publication date 1988

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

surveyschedulingcommon due datequadratic loss functionsseveral machinesvariance of completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Recommendations

• Exact penalty functionals in scheduling problems
• scientific article; zbMATH DE number 67596
• Publication:3478253
• A metric approach for scheduling problems with minimizing the maximum penalty
• Scheduling jobs with time-resource tradeoff via nonlinear programming
• Continuous nonlinear programming techniques to solve scheduling problems
• Machine scheduling with earliness, tardiness and non-execution penalties
• scientific article; zbMATH DE number 1159455
• Non-clairvoyantly scheduling to minimize convex functions
• Non-approximability results for scheduling problems with minsum criteria

Cited in

(13)

• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
• Earliness-tardiness scheduling problems with a common delivery window
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Job sequencing and due date assignment in a single machine shop with uncertain processing times
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• Tabu search for a class of single-machine scheduling problems
• Optimal sequences in stochastic single machine shops
• Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
• Determination of common due window location in a single machine scheduling problem
• Multiple and bicriteria scheduling: A literature survey

This page was built for publication: Scheduling problems with non-regular penalty functions - a review

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