Shop scheduling problems with pliable jobs
From MaRDI portal
Publication:2294890
DOI10.1007/s10951-019-00607-9zbMath1432.90059OpenAlexW2921509095WikidataQ128123536 ScholiaQ128123536MaRDI QIDQ2294890
Publication date: 12 February 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-019-00607-9
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Exact solution of the two-machine flow shop problem with three operations ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The three-machine proportionate open shop and mixed shop minimum makespan problems
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
- Synchronous flow shop scheduling with pliable jobs
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
- Throughput optimization in two-machine flowshops with flexible operations
- Permutation vs. non-permutation flow shop schedules
- Minimizing total weighted completion time in a proportionate flow shop
- Flow shop scheduling with flexible processing times
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
- Dynamic task assignment for throughput maximization with worksharing
- A framework for the complexity of high-multiplicity scheduling problems
- Scheduling with Deadlines and Loss Functions
- Optimal two- and three-stage production schedules with setup times included
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Preemptive Scheduling with Due Dates
- An Algorithm for Large Zero-One Knapsack Problems
- Open Shop Scheduling to Minimize Finish Time
- The Complexity of Flowshop and Jobshop Scheduling
- Basic Techniques for Lot Streaming
- Sequencing and scheduling in flowshops with task redistribution
- A note on the influence of missing operations on scheduling problems
- Design and operation of dynamic assembly lines using work-sharing
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Scheduling
This page was built for publication: Shop scheduling problems with pliable jobs
