article

Job-shop scheduling with multi-purpose machines

Authors:

P. Brucker,

R. SchlieAuthors Info & Claims

Computing, Volume 45, Issue 4

Pages 369 - 375

https://doi.org/10.1007/BF02238804

Published: 02 January 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Cheng QKan HRen JLiu ZZhang YCheng C(2024)Multi-objective optimization method for cross-workshop linkage production of partially flexible free-forging with forward single-machine schedulingComputers and Industrial Engineering10.1016/j.cie.2024.110508196:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.cie.2024.110508
Akram KBhutta MButt SJaffery SKhan MKhan AFaraz Z(2024)A Pareto-optimality based black widow spider algorithm for energy efficient flexible job shop scheduling problem considering new job insertionApplied Soft Computing10.1016/j.asoc.2024.111937164:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.asoc.2024.111937
Wocker MOstermeier FWanninger TZwinkau RDeuse J(2024)Flexible job shop scheduling with preventive maintenance considerationJournal of Intelligent Manufacturing10.1007/s10845-023-02114-335:4(1517-1539)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s10845-023-02114-3
Show More Cited By

Index Terms

Job-shop scheduling with multi-purpose machines
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Paths and connectivity problems
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management
        Scheduling

Recommendations

Tighter bounds on preemptive job shop scheduling with two machines

We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most P_max/2 greater than the optimal schedule length, where P_max is the ...
Minimising makespan for two batch-processing machines with non-identical job sizes in job shop

In this article, the job shop scheduling problem with two batch-processing machines is considered. The machines have limited capacity and the jobs have non-identical job sizes. The jobs are processed in batches and the total size of each batch cannot ...
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

Flexible job shop scheduling problem.Ensembles of heuristics.Re-scheduling for new job insertion.Multiple objectives scheduling problem. This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Computing Volume 45, Issue 4

1990

93 pages

ISSN:0010-485X

Editor:
Willard L. Miranker
IBM Thomas J. Watson Research Center, Yorktown Heights, NY

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 02 January 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

111
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cheng QKan HRen JLiu ZZhang YCheng C(2024)Multi-objective optimization method for cross-workshop linkage production of partially flexible free-forging with forward single-machine schedulingComputers and Industrial Engineering10.1016/j.cie.2024.110508196:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.cie.2024.110508
Akram KBhutta MButt SJaffery SKhan MKhan AFaraz Z(2024)A Pareto-optimality based black widow spider algorithm for energy efficient flexible job shop scheduling problem considering new job insertionApplied Soft Computing10.1016/j.asoc.2024.111937164:COnline publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1016/j.asoc.2024.111937
Wocker MOstermeier FWanninger TZwinkau RDeuse J(2024)Flexible job shop scheduling with preventive maintenance considerationJournal of Intelligent Manufacturing10.1007/s10845-023-02114-335:4(1517-1539)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s10845-023-02114-3
Jing XYao XLiu MZhou J(2024)Multi-agent reinforcement learning based on graph convolutional network for flexible job shop schedulingJournal of Intelligent Manufacturing10.1007/s10845-022-02037-535:1(75-93)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s10845-022-02037-5
Zhang WLi J(2024)A Knowledge-Driven Cooperative Optimization Algorithm for Multi-objective Energy-Efficient Flexible Job Scheduling with Variable Machine SpeedsAdvanced Intelligent Computing Technology and Applications10.1007/978-981-97-5603-2_41(494-505)Online publication date: 5-Aug-2024
https://dl.acm.org/doi/10.1007/978-981-97-5603-2_41
Mastria EPagliaro DCalimeri FPerri SPleschberger MSchekotihin K(2024)Monitoring and Scheduling of Semiconductor Failure Analysis LabsLogic Programming and Nonmonotonic Reasoning10.1007/978-3-031-74209-5_17(215-227)Online publication date: 11-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-74209-5_17
Zhang FMei YZhang MSilva SPaquete L(2023)An Investigation of Terminal Settings on Multitask Multi-objective Dynamic Flexible Job Shop Scheduling with Genetic ProgrammingProceedings of the Companion Conference on Genetic and Evolutionary Computation10.1145/3583133.3590546(259-262)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583133.3590546
Zhu LZhang FZhu XChen KZhang MSilva SPaquete L(2023)Sample-Aware Surrogate-Assisted Genetic Programming for Scheduling Heuristics Learning in Dynamic Flexible Job Shop SchedulingProceedings of the Genetic and Evolutionary Computation Conference10.1145/3583131.3590440(384-392)Online publication date: 15-Jul-2023
https://dl.acm.org/doi/10.1145/3583131.3590440
Ding JDauzère-Pérès SShen LLü Z(2023)A Novel Evolutionary Algorithm for Energy-Efficient Scheduling in Flexible Job ShopsIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.322279127:5(1470-1484)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1109/TEVC.2022.3222791
Zhang FMei YNguyen STan KZhang M(2023)Task Relatedness-Based Multitask Genetic Programming for Dynamic Flexible Job Shop SchedulingIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.319978327:6(1705-1719)Online publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1109/TEVC.2022.3199783
Show More Cited By

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Tighter bounds on preemptive job shop scheduling with two machines

Minimising makespan for two batch-processing machines with non-identical job sizes in job shop

Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations