The job shop scheduling problem: Conventional and new solution techniques (Q1268188): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Jacek Błażewicz / rank
Normal rank
 
Property / author
 
Property / author: Jacek Błażewicz / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57387872 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Genocop / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JOBSHOP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CHIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00362-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162535720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Flow-Shop Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of scheduling polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the General Job-Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized permutation approach to job shop scheduling with genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming formulations for machine scheduling: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Schedule-Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Modeling of Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the job-shop problem with two jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Three-Stage Flow-Shops with Recessive Second Stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates and tails on identical machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustment of heads and tails for the job-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Machine-Scheduling Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation studies in JIT production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified shifting bottleneck procedure for job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of sequencing research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Clustering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution based learning in a job shop scheduling environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lessons of Flowshop Scheduling Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate duality relaxation for job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Direct Search Method to Locate Negative Cycles in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrelated parallel machine scheduling using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP ejection chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block approach for single-machine scheduling with release dates and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-Bound Solution to the General Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on Mohr and Henderson's path consistency algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of priority rule-based scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic arc-consistency algorithm and its specializations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms: Foundations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the n-job, M-machine flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search with influential diversification to multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: DETERMINISTIC SCHEDULING IN COMPUTER SYSTEMS: A SURVEY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic local search in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided complexity classification of combinational problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-Shop Scheduling by Implicit Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling: Computational study of local search and large-step optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to computing optimal schedules for the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4891488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4872475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision support system for the resource constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimizing maximum lateness in a one-machine sequencing problem with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of constraint satisfaction for multiple capacitated job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general search sequencing rule for job shop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Scheduling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4031974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive branching rule for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation vs. non-permutation flow shop schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Machine No-Wait Flow Shop is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of shop-scheduling problems with two or three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of shop-scheduling problems with three jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem and Heuristic Space Search Strategies for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective job shop scheduling through active chain manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination methods in them ×n sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Elimination Methods in the <i>m</i> × <i>n</i> Flow-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975934 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:49, 28 May 2024

scientific article
Language Label Description Also known as
English
The job shop scheduling problem: Conventional and new solution techniques
scientific article

    Statements

    The job shop scheduling problem: Conventional and new solution techniques (English)
    0 references
    0 references
    0 references
    0 references
    18 October 1998
    0 references
    job shop
    0 references
    scheduling
    0 references
    survey
    0 references
    solution techniques
    0 references
    job shop problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers