Order acceptance and two parallel machines scheduling problem with an availability constraint

DOI10.3969/J.ISSN.1001-5337.2016.1.036MaRDI QIDQ2824193zbMATH OpenFDO

Authors Jingjing Chi, Yan Sun

Publication date 6 October 2016

Published in Journal of Qufu Normal University. Natural Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-5337.2016.1.036

zbMATH Keywords

dynamic programmingrejectionschedulingtwo parallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 6672186
• Order acceptance and scheduling with machine availability constraints
• Single Machine Scheduling with an Availability Constraint and Rejection
• Makespan minimization for two parallel machines with an availability constraint
• Parallel-machine scheduling with release dates and rejection

Cited in

(7)

• Bicriteria order acceptance and scheduling with consideration of fill rate
• Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints
• A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime
• Order acceptance and scheduling with machine availability constraints
• Order acceptance and scheduling problems in two-machine flow shops: new mixed integer programming formulations
• Order acceptance and scheduling with consideration of service level
• Order acceptance and scheduling on parallel machines with setup time and machine-eligibility constraints

This page was built for publication: Order acceptance and two parallel machines scheduling problem with an availability constraint

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