A branch and bound to minimize the number of late jobs on a single machine with release time constraints-Reference-Cited by-同舟云学术

A branch and bound to minimize the number of late jobs on a single machine with release time constraints

Published:2003-01 Issue:1 Volume:144 Page:1-11
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Baptiste Philippe,Peridy Laurent,Pinson Eric

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference32 articles.

1. Network Flows;Ahuja,1993

2. An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs;Baptiste;Operations Research Letters,1999

3. Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal;Baptiste;Journal of Scheduling,1999

4. Constraint-based scheduling: Applying constraint programming to scheduling problems;Baptiste,2001

5. Global constraints for partials csps: a case study of resource and due date constraints;Baptiste,1998

Cited by 40 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty;Journal of Scheduling;2023-02-07

2. Scheduling for last-mile meal-delivery processes;IFAC-PapersOnLine;2019

3. A HYBRID META-HEURISTIC ALGORITHM TO MINIMIZE THE NUMBER OF TARDY JOBS IN A DYNAMIC TWO-MACHINE FLOW SHOP PROBLEM;NUMER ALGEBR CONTROL;2017

4. Changeover formulations for discrete-time mixed-integer programming scheduling models;European Journal of Operational Research;2017-08

5. A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem;Numerical Algebra, Control & Optimization;2017